Fast SDP relaxations of graph cut clustering, transduction,and other combinatorial problems

Journal of Machine Learning Research

Volumn 7, Issue , 2006, Pages 1409-1436

  De Bie, Tijl ^a,b   Cristianini, Nello ^c  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF LEUVEN   (Belgium)

^c UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

Combinatorial optimization; Convex transduction; Max cut; Normalized graph cut; Relaxation; Semi definite programming; Semi supervised learning

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; GRAPH THEORY; LEARNING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION; CONVEX TRANSDUCTION; MAX-CUT; NORMALIZED GRAPH CUT; RELAXATION; SEMI-DEFINITE PROGRAMMING; SEMI-SUPERVISED LEARNING;

COMBINATORIAL MATHEMATICS;

EID: 33745769084     PISSN: 15337928     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. M. F. Anjos and H. Wolkowicz. Strengthened semidefinite relaxations via a second lifting for the MAX-CUT problem. Discrete Applied Mathematics, 119:79-106, 2002.
2. A. Blum and S. Chawla. Learning from labeled and unlabeled data using graph mincuts. In Proc. of the 18th International Conf. on Machine Learning (ICML), 2001.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, Cambridge, U.K., 2004.
4. S. Burer and R. D. C. Monteiro. A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization. Mathematical Programming (series B), 95(2):329-357, 2003.
5. S. Burer and R. D. C. Monteiro. Local minima and convergence in low-rank semidefinite programming. Mathematical Programming (series A), 103(3):427-444, 2005.
6. O. Chapelle, J. Weston, and B. Schölkopf. Cluster kernels for semi-supervised learning. In S. Becker, S. Thrun, and K. Obermayer, editors, Advances in Neural Information Processing Systems 15. MIT Press, Cambridge, MA, 2003.
7. N. Cristianini, J. Shawe-Taylor, and J. Kandola. Spectral kernel methods for clustering. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
8. T. De Bie and N. Cristianini. Convex methods for transduction. In Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004a.
9. T. De Bie and N. Cristianini. Kernel methods for exploratory data analysis: a demonstration on text data. In Proceedings of the International Workshop on Statistical Pattern Recognition (SPR2004). Lisbon, Portugal, August 2004b.
10. T. De Bie, J. Suykens, and B. De Moor. Learning from general label constraints. In Proceedings of IAPR International Workshop on Statistical Pattern Recognition (SPR). 2004.
11. M. X. Goemans and D. P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42 (6):1115-1145, 1995.
12. C. Helmberg. Semidefinite programming for combinatorial optimization. Habilitationsschrift ZIB-Report ZR-00-34, TU Berlin, Konrad-Zuse-Zentrum Berlin, 2000.
13. C. Helmberg and F. Rendl. A spectral bundle method for semidefinite programming. SIAM Journal on Optimization, 10:673-696, 2000.
14. T. Joachims. Transductive learning via spectral graph partitioning. In Proceedings of the International Conference on Machine Learning (ICML), 2003.
15. S. D. Kamvar, D. Klein, and C. D. Manning. Spectral learning. In IJCAI, 2003.
16. K. Lang. Finding good nearly balanced cuts in power law graphs. Technical Report YRL-2004-036, Yahoo! Research, 2004.
17. A. Ng, M. I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
18. N. Shental, A. Bar-Hillel, T. Hertz, and D. Weinshall. Computing Gaussian mixture models with EM using equivalence constraints. In Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004.
19. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
20. J. F. Sturm. Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optimization Methods and Software, Special issue on Interior Point Methods (CD supplement with software), 11-12:625-653, 1999.
21. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
22. E. P. Xing and M. I. Jordan. On semidefinite relaxation for normalized k-cut and connections to spectral clustering. Technical Report CSD-03-1265, Division of Computer Science, University of California, Berkeley, 2003.