DIFFRAC : A discriminative and flexible framework for clustering

Advances in Neural Information Processing Systems 20 - Proceedings of the 2007 Conference

Volumn , Issue , 2008, Pages

  Bach, Francis R ^a   Harchaoui, Zaïd ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); CLUSTERING ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONVEX OPTIMIZATION; RELAXATION PROCESSES; SINGULAR VALUE DECOMPOSITION; SUPERVISED LEARNING;

CLUSTERINGS; COMBINATORIAL OPTIMIZATION PROBLEMS; CONVEX OPTIMIZATION PROBLEMS; CONVEX RELAXATION; COST-FUNCTION; FLEXIBLE FRAMEWORK; K-MEANS; LINEAR CLUSTERING; LOW DIMENSIONAL; PROPERTY;

COST FUNCTIONS;

EID: 85161978168     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. L. Xu, J. Neufeld, B. Larson, and D. Schuurmans. Maximum margin clustering. In Adv. NIPS, 2004.
2. T. De Bie and N. Cristianini. Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems. J. Mac. Learn. Res., 7:1409-1436, 2006. (Pubitemid 44024594)
3. K. Zhang, I. W. Tsang, and J. T. Kwok. Maximum margin clustering made practical. In Proc. ICML, 2007.
4. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning. Springer-Verlag, 2001.
5. J. Shawe-Taylor and N. Cristianini. Kernel Methods for Pattern Analysis. Camb. Univ. Press, 2004.
6. A. Frieze and M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. In Integer Programming and Combinatorial Optimization, volume 920, pages 1-13. Springer, 1995.
7. C. Swamy. Correlation clustering: maximizing agreements via semidefinite programming. In ACM-SIAM Symp. Discrete algorithms, 2004.
8. A. S. Lewis and H. S. Sendov. Twice differentiable spectral functions. SIAM J. Mat. Anal. App., 23(2):368-386, 2002.
9. F R. Bach and M I. Jordan. Learning spectral clustering, with application to speech separation. J. Mac. Learn. Res., 7:1963-2001, 2006. (Pubitemid 44497457)
10. B. Schölkopf, A. J. Smola, and K.-R. Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Comp., 10(3):1299-1319, 1998. (Pubitemid 128463674)
11. N. Srebro, G. Shakhnarovich, and S. Roweis. An investigation of computational and informational limits in gaussian mixture clustering. In Proc. ICML, 2006.
12. S. Boyd and L. Vandenberghe. Convex Optimization. Camb. Univ. Press, 2003.
13. J. F. Bonnans, J. C. Gilbert, C. Lemaréchal, and C. A. Sagastizbal. Numerical Optimization Theoretical and Practical Aspects. Springer, 2003.
14. A. Y. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: analysis and an algorithm. In Adv. NIPS, 2002.
15. L. Xu and D. Schuurmans. Unsupervised and semi-supervised multi-class support vector machines. In Proc. AAAI, 2005.
16. M. Heiler, J. Keuchel, and C. Schnörr. Semidefinite clustering for image segmentation with a-priori knowledge. In Pattern Recognition, Proc. DAGM, 2005.
17. K. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl. Constrained K-means clustering with background knowledge. In Proc. ICML, 2001.
18. A. Bar-Hillel, T. Hertz, N. Shental, and D. Weinshall. Learning distance functions using equivalence relations. In Proc. ICML, 2003.
19. O. Chapelle and A. Zien. Semi-supervised classification by low density separation. In Proc. AISTATS, 2004.
20. F. R. Bach, G. R. G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the SMO algorithm. In Proc. ICML, 2004.