Semidefinite spectral clustering

Pattern Recognition

Volumn 39, Issue 11, 2006, Pages 2025-2035

  Kim, Jaehwan ^a   Choi, Seungjin ^b  

^a Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^b Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Clustering; Convex optimization; Multi way graph equipartitioning; Semidefinite programming; Spectral clustering

Indexed keywords

GRAPH THEORY; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SPECTRUM ANALYSIS;

CLUSTERING; CONVEX OPTIMIZATION; MULTI-WAY GRAPH EQUIPARTITIONING; SEMIDEFINITE PROGRAMMING; SPECTRAL CLUSTERING;

EDGE DETECTION;

EID: 33746846141     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2006.05.021     Document Type: Article

References (14)

1. Shi J., and Malik J. Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22 8 (2000) 888-905
2. Weiss Y. Segmentation using eigenvectors: a unifying view. Proceedings of the International Conference on Computer Vision (1999) 975-982
3. Meila M., and Shi J. A random walks view of spectral segmentation. Proceedings of the International Workshop on Artificial Intelligence and Statistics. Key West, FL (2001)
4. A.Y. Ng, M.I. Jordan, Y. Weiss, On spectral clustering: analaysis and an algorithm, in: Advances in Neural Information Processing Systems, vol. 14, MIT Press, Cambridge, MA, 2002.
5. M. Gu, H. Zha, C. Ding, X. He, H. Simon, Spectral relaxation models and structure analysis for k-way graph clustering and bi-clustering, Technical Report CSE-01-007, Penn State University, 2001.
6. Rendl F. Semidefinite programming and combinatorial optimization. Appl. Numer. Math. 29 3 (1999) 255-281
7. Q. Zhao, Semidefinite Programming for Assignment and Partitioning Problems, Ph.D. Thesis, University of Waterloo, 1996.
8. Zhao Q., Karisch S., Rendl F., and Wolkowicz H. Semidefinite programming relaxations for the quadratic assignment problem. J. Combinatorial Optim. 2 1 (1998) 71-109
9. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Math. J. 25 2 (1975) 619-633
10. Ding C., He X., Zha H., Gu M., and Simon H. Spectral min-max cut for graph partitioning and data clustering. Proceedings of the IEEE International Conference on Data Mining. San Nose, CA (2001) 107-114
11. Keuchel J., Schnörr C., Schellewald C., and Cremers D. Binary partitioning, perceptual grouping, and restoration with semidefinite programming. IEEE Trans. Pattern Anal. Mach. Intell. 25 11 (2003) 1364-1379
12. Pataki G. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23 (1998) 339-358
13. A. McCallum, Bow: a toolkit for statistical language modeling, text retrieval, classification and clustering, 1996.
14. Boyd S., and Vandenberghe L. Convex Optimization (2004), Cambridge University Press, Cambridge