Maximum margin clustering with pairwise constraints

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2008, Pages 253-262

  Hu, Yang ^a   Wang, Jingdong ^b   Yu, Nenghai ^a   Hua, Xian Sheng ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b MICROSOFT RESEARCH ASIA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CONCAVE-CONVEX PROCEDURE; CUTTING PLANE ALGORITHMS; LOSS FUNCTIONS; MAXIMUM MARGIN; MULTI-CLASS; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; PAIRWISE CONSTRAINTS; SIDE-INFORMATION;

COMPUTATIONAL COMPLEXITY; CONSTRAINED OPTIMIZATION; CONVEX OPTIMIZATION; EDUCATION; INFORMATION MANAGEMENT; METALLIC MATRIX COMPOSITES; MINING;

CLUSTERING ALGORITHMS;

EID: 67049098035     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2008.65     Document Type: Conference Paper

References (24)

1. A. Bar-Hillel, T. Hertz, N. Shental, and D.Weinshall. Learning distance functions using equivalence relations. In ICML, 2003.
2. S. Basu, M. Bilenko, and R. J. Mooney. A probabilistic framework for semi-supervised clustering. In KDD, 2004.
3. M. Bilenko, S. Basu, and R. J. Mooney. Integrating constraints and metric learning in semi-supervised clustering. In ICML, 2004.
4. P.-M. Cheung and J. T. Kwok. A regularization framework for multiple-instance learning. In ICML, 2006.
5. R. Collobert, F. Sinz, J. Weston, and L. Bottou. Large scale transductive svms. Journal of Machine Learning Research, 7, 2006.
6. K. Crammer and Y. Singer. On the algorithmic implementation of multiclass kernel-based vector machines. Journal of Machine Learning Research, 2001.
7. S. C. H. Hoi, W. Liu, M. R. Lyu, and W.-Y. Ma. Learning distance metrics with contextual constraints for image retrieval. In CVPR, 2006.
8. J. J. E. Kelley. The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8:703-712, 1960.
9. T. Joachims. Training linear SVMs in linear time. In KDD, 2006.
10. T. Joachims, T. Finley, and C.-N. Yu. Cutting-plane training of structural svms. Machine Learning, to appear.
11. D. Klein, S. D. Kamvar, and C. D. Manning. From instancelevel constraints to space-level constraints: Making the most of prior knowledge in data clustering. In ICML, 2002.
12. T. H. Noam Shental, Aharon Bar-Hillel and D. Weinshall. Computing gaussian mixture models with em using equivalence constraints. In NIPS, 2003.
13. S.Boyd and L.Vandenberghe. Subgradients. In Lecture Notes for EE364b: Convex Optimization II, 2007.
14. A. J. Smola, S. Vishwanathan, and T. Hoffman. Kernel methods for missing variables. In AISTATS, 2005.
15. H. Valizadegan and R. Jin. Generalized maximum margin clustering and unsupervised kernel learning. In NIPS 19, 2007.
16. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl. Constrained k-means clustering with background knowledge. In ICML, 2001.
17. E. P. Xing, A. Y. Ng, M. I. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. In NIPS, 2003.
18. L. Xu, J. Neufeld, B. Larson, and D. Schuurmans. Maximum margin clustering. In NIPS 17, 2005.
19. L. Xu and D. Schuurmans. Unsupervised and semisupervised multi-class support vector machines. In AAAI, 2005.
20. R. Yan, J. Zhang, J. Yang, and A. G. Hauptmann. A discriminative learning framework with pairwise constraints for video object classification. IEEE Trans. Pattern Anal. Mach. Intell., 28(4), 2006.
21. A. Yuille and A. Rangarajan. The concave-convex procedure (CCCP). Neural Computation, 15, 2003.
22. K. Zhang, I. W. Tsang, and J. T. Kwok. Maximum margin clustering made practical. In ICML, 2007.
23. B. Zhao, F.Wang, and C. Zhang. Efficient maximum margin clustering via cutting plane algorithm. In SDM, 2008.
24. B. Zhao, F. Wang, and C. Zhang. Efficient multiclass maximum margin clustering. In ICML, 2008.