Spectral clustering with more than K eigenvectors

Neurocomputing

Volumn 74, Issue 9, 2011, Pages 1391-1401

  Rebagliati, Nicola ^a   Verri, Alessandro ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

Spectral clustering; Spectral gap

Indexed keywords

APPROXIMATE SOLUTION; CUTTING PROBLEMS; DIMENSIONAL SUBSPACE; EIGEN-VALUE; EIGENVALUES; EIGENVECTORS; GAP SIZE; LINEAR SPAN; NORMALIZED LAPLACIAN; NP COMPLETE; OPTIMAL PARTITIONS; PROBABILISTIC ALGORITHM; REAL-WORLD GRAPHS; SPECTRAL CLUSTERING; SPECTRAL GAP; SPECTRAL TECHNIQUES; STATE OF THE ART;

EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC ALGORITHMS; MATRIX ALGEBRA; OPTIMIZATION;

CLUSTERING ALGORITHMS;

ARTICLE; CLUSTER ANALYSIS; IMAGE PROCESSING; K NEAREST NEIGHBOR; KERNEL METHOD; LEARNING ALGORITHM; MATHEMATICAL COMPUTING; NORMAL DISTRIBUTION; PLOTS AND CURVES; PRIORITY JOURNAL; PROBABILITY; REPRODUCIBILITY; VALIDATION PROCESS;

EID: 79953051126     PISSN: 09252312     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.neucom.2010.12.008     Document Type: Article

References (40)

1. Shi J., Malik J. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 1997, 22:888-905.
2. Bach F.R., Jordan M.I. Learning spectral clustering, with application to speech separation. Journal of Machine Learning Research 2006, 7:1963-2001.
3. Belkin M., Niyogi P., Sindhwani V. Manifold regularization: a geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research 2006, 7:2399-2434.
4. M. Meilâ, J. Shi, Learning segmentation by random walks, in: NIPS, 2000, pp. 873-879.
5. A.Y. Ng, M.I. Jordan, Y. Weiss, On spectral clustering: analysis and an algorithm, in: NIPS, 2001, pp. 849-856.
6. C.H.Q. Ding, X. He, k-Means clustering via principal component analysis, in: ICML, 2004.
7. M. Szummer, T. Jaakkola, Partially labeled classification with Markov random walks, in: NIPS, 2001, pp. 945-952.
8. T. Joachims, Transductive learning via spectral graph partitioning, in: ICML, 2003, pp. 290-297.
9. B. Nadler, S. Lafon, R. Coifman, I.G. Kevrekidis. Diffusion maps-a probabilistic interpretation for spectral embedding and clustering algorithms, 2007.
10. F. Rendl, H. Wolkowicz, A projection technique for partitioning the nodes of a graph, 1995.
11. S. Guattery, G.L. Miller, On the performance of spectral graph partitioning methods, in: SODA, 1995, pp. 233-242.
12. Alpert C.J., Kahng A.B., Yao S.-Z. Spectral partitioning with multiple eigenvectors. Discrete Applied Mathematics 1999, 90(1-3):3-26.
13. Donath W.E., Hoffman A.J. Lower bounds for the partitioning of graphs. IBM Journal of Research and Development 1973, 17:420-425.
14. Fiedler M. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal 1975, 25.
15. Alpert C.J., Kahng A.B. Recent directions in netlist partitioning: a survey. Integration: The VLSI Journal 1995, 19:1-81.
16. K. Lang, Fixing two weaknesses of the spectral method, in: NIPS, 2005.
17. R. Andersen, K.J. Lang, An algorithm for improving graph partitions, in: SODA, 2008, pp. 651-660.
18. J.A. Frankle, R.M. Karp, Circuit placement by eigenvector decomposition, in: ICCAD, 1986.
19. J.A. Frankle, Circuit placement methods using multiple eigenvectors and linear probe techniques. Ph.D. Thesis, EECS Department, University of California, Berkeley, 1987.
20. Xiang T., Gong S. Spectral clustering with eigenvector selection. Pattern Recognition 2008, 41(3):1012-1029.
21. Zhao F., Jiao L., Liu H., Gao X., Gong M. Spectral clustering with eigenvector selection based on entropy ranking. Neurocomputing 2010, 73(10-12):1704-1717.
22. N. Rebagliati, A. Verri, A randomized algorithm for spectral clustering, in: ESANN, 2010, pp. 381-386.
23. L. Zelnik-Manor, P. Perona, Self-tuning spectral clustering, in: NIPS, 2004.
24. F.R.K. Chung, Spectral graph theory, in: CBMS Regional Conference Series in Mathematics, vol. 92, AMS, February 1997.
25. Wu Z., Leahy R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 1993, 15(11):1101-1113.
26. von Luxburg U. A tutorial on spectral clustering. Statistics and Computing 2007, 17(4):395-416.
27. M. Meilâ, The uniqueness of a good optimum for k-means, in: ICML, 2006, pp. 625-632.
28. Fan K. Maximum properties and inequalities for the eigenvalues of completely continuous operators. Proceedings of the National Academy of Science 1951, 37(November):760-766.
29. M. Meila, S. Shortreed, L. Xu, Regularized spectral learning, Technical report, Proceedings of the Artificial Intelligence and Statistics Workshop (AISTATS 05), 2005.
30. A. Singer, From graph to manifold Laplacian: the convergence rate, 2006.
31. I.S. Dhillon, Y. Guan, B. Kulis, Kernel k-means: spectral clustering and normalized cuts, in: KDD, 2004, pp. 551-556.
32. N. Rebagliati, Spectral techniques for clustering, Ph.D. Thesis, 2010.
33. Golub G.H., Van Loan C.F. Matrix Computations, Johns Hopkins Studies in Mathematical Sciences October 1996, The Johns Hopkins University Press.
34. Absil P.-A., Edelman A., Koev P. On the largest principal angle between random subspaces. Linear Algebra Application 2006, 414(1):288-294.
35. Koev P., Edelman A. The efficient evaluation of the hypergeometric function of a matrix argument. Mathematics of Computation 2006, 75:833-846.
36. M. Meilâ, Comparing clusterings by the variation of information, in: COLT, 2003, pp. 173-187.
37. Fiduccia C.M., Mattheyses R.M. A linear-time heuristic for improving network partitions. 25 Years of DAC: Papers on Twenty-five Years of Electronic Design Automation 1988, 241-247. ACM, New York, NY, USA.
38. A.J. Soper, C. Walshaw, M. Cross, A combined evolutionary search and multilevel approach to graph partitioning, Journal of Global Optimization, 2004.
39. Garey M.R., Johnson D.S., Stockmeyer L. Some simplified np-complete problems. STOC '74: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing 1974, 47-63. ACM, New York, NY, USA.
40. L.W. Hagen, A.B. Kahng, New spectral methods for ratio cut partitioning and clustering, 1992.