Efficient multiclass maximum margin clustering

Proceedings of the 25th International Conference on Machine Learning

Volumn , Issue , 2008, Pages 1248-1255

  Zhao, Bin ^a   Wang, Fei ^a   Zhang, Changshui ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; MACHINE LEARNING; CONVEX OPTIMIZATION; LEARNING SYSTEMS; METALLIC MATRIX COMPOSITES; ROBOT LEARNING;

CONSTRAINED CONCAVE-CONVEX PROCEDURES; CUTTING PLANE ALGORITHMS; EXPERIMENTAL EVALUATION; MAXIMUM MARGIN CLUSTERING; NESTED SEQUENCES; OPTIMIZATION PROBLEMS; REAL-WORLD DATASETS;

CLUSTERING ALGORITHMS;

CONCAVE-CONVEX PROCEDURES; CUTTING PLANE ALGORITHMS; DATA-SETS; EXPERIMENTAL EVALUATIONS; MAXIMUM MARGINS; MULTI CLASS; OPTIMIZATION PROBLEMS; REAL-WORLD DATASETS;

EID: 56449122823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390156.1390313     Document Type: Conference Paper

References (17)

1. Crammer, K., & Singer, Y. (2001). On the algorithmic implementation of multiclass kernel-based vector machines. JMLR, 2, 265-292.
2. Ding, C., He, X., Zha, H., Gu, M., & Simon, H. D. (2001). A min-max cut algorithm for graph partitioning and data mining. ICDM (pp. 107-114).
3. Duda, R. O., Hart, P. E., & Stork, D. G. (2001). Pattern classi cation. John Wiley & Sons, Inc.
4. Joachims, T. (2006). Training linear svms in linear time. SIGKDD 12.
5. Kelley, J. E. (1960). The cutting-plane method for solving convex programs. Journal of the Society for Industrial Applied Mathematics, 8, 703-712.
6. Lewis, D. D., Yang, Y., Rose, T., & Li, F. (2004). Rcv1: A new benchmark collection for text categorization research. JMLR, 5, 361-397.
7. McCallum, A., Nigam, K., Rennie, J., & Seymore, K. (2000). Automating the contraction of internet portals with machine learning. Information Retrieval Journal, 3, 127-163.
8. Rand, W. M. (1971). Objective criteria for the evaluation of clustering methods. JASA, 66, 846-850.
9. Schölkopf, B., Smola, A. J., & Müller, K. R. (1999). Kernel principal component analysis. Advances in kernel methods: support vector learning, 327-352.
10. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. PAMI.
11. Smola, A. J., Vishwanathan, S., & Hofmann, T. (2005). Kernel methods for missing variables. AISTATS 10.
12. Tsochantaridis, I., Joachims, T., Hofmann, T., & Altun, Y. (2005). Large margin methods for structured and interdependent output variables. JMLR, 6, 1453-1484.
13. Valizadegan, H., & Jin, R. (2007). Generalized maximum margin clustering and unsupervised kernel learning. NIPS 19 (pp. 1417-1424).
14. Xu, L., Neufeld, J., Larson, B., & Schuurmans, D. (2004). Maximum margin clustering. NIPS 17.
15. Xu, L., & Schuunnans, D. (2005). Unsupervised and semi-supervised multi-class support vector machines. AAAI.
16. Zhang, K., Tsang, I. W., & Kowk, J. T. (2007). Maximum margin clustering made practical. ICML 24.
17. Zhao, B., Wang, F., & Zhang, C. (2008). E cient maximum margin clustering via cutting plane algorithm. SDM (pp. 751-762).