Spectral clustering based on matrix perturbation theory

Science in China, Series F: Information Sciences

Volumn 50, Issue 1, 2007, Pages 63-81

  Tian, Zheng ^a,b   Li, Xiaobin ^a   Ju, Yanwei ^a  

^a NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

^b INSTITUTE OF AUTOMATION   (China)

Author keywords

Number of the clusters; Spectral clustering; Spectrum of weight matrix; Unsupervised spectral clustering algorithm based on weight matrix; Weight matrix

Indexed keywords

EID: 34247272280     PISSN: 10092757     EISSN: 18622836     Source Type: Journal    
DOI: 10.1007/s11432-007-0007-8     Document Type: Article

References (17)

1. Bach R, Jordan M I. Learning spectral clustering. University of California at Berkeley Technical report UCB/CSD-03-1249. 2003
2. Xing E P, Jordan M I. On semidefinite relaxation for normalized k-cut and connections to spectral clustering. University of California at Berkeley Technical report UCB/CSD-3-1265. 2003
3. Donath WE, Hoffman A J. Lower bounds for partitioning of graphs. IBM J Res Devel, 1973, 17(5): 420-425
4. Fiedler M. A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czechoslovak Mathemat J, 1975, 25(100): 619-633
5. Hagen L, Kahng A B. New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput-Aid Design, 1992, 11(9): 1074-1085
6. Chan P K, Schlag M D F, Zien J Y. Spectral k-way ratio-cut partitioning and clustering. IEEE Trans Comput-Aid Design Integ Circ Syst, 1994, 13(9): 1088-1096
7. Shi J, Malik J. Normalized cuts and image segmentation. IEEE Trans Patt Anal Mach Intel, 2000, 22(8): 888-905
8. Fowlkes C, Belongie S, Chung F, et al. Spectral grouping using the Nystrom method. IEEE Trans Patt Anal Mach Intel, 2004, 26(2): 214-225
9. Ding C H Q, He X, Zha H, et al. A min-max cut algorithm for graph partitioning and data clustering. In: Gereone N, Lin T Y, Wu X, eds. ICDM2001. Los Alamitos, California: IEEE Computer Society, 2001. 107-114
10. Ding C H Q, He X, Zha H. A spectral method to separate disconnected and nearly-disconnected web graph components. In: Provost F, Srikant R, eds. Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: Association for Computing Machinery, 2001. 275-280
11. Weiss Y. Segmentation using eigenvectors: a unifying view. In: Computer Vision, 1999, the proceedings of the Seventh IEEE International Conference on. Los Alamitos, California: IEEE Computer Society, 1999. 975-982
12. Dhillon I S, Guan Y, Kulis B. A unified view of kernel k-means, spectral clustering and graph cuts. University of Texas at Austin UTCS Technical Report TR-04-25. 2004
13. Kannan R, Vempala S, Vetta A. On clusterings: good, bad and spectral. J ACM, 2004, 51(3): 597-515
14. Ng A Y, Jordan M I, Weiss Y. On spectral clustering: Analysis and an algorithm. In: Dietterich T G, Becker S, Ghahramani Z, eds. Advances in Neural Information Processing Systems 14. Cambridge, MA: MIT Press, 2002. 849-856
15. Brand M, Huang K. A unifying theorem for spectral embedding and clustering. Mitsubishi Electric Research Laboratory Technichal Report TR2002-42. 2002.
16. Sun J. Matrix Perturbation Analysis (in Chinese). 2nd ed. Beijing: Science Press, 2001. 252-272
17. Hettich S, Bay S D. The UCI KDD Archive [http://kdd.ics.uci.edu]. Irvine, CA: University of California, Department of Information and Computer Science, 1999