Limits of spectral clustering

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages

  Von Luxburg, Ulrike ^a   Bousquet, Olivier ^a   Belkin, Mikhail ^b  

^a MAX PLANCK INSTITUTE FOR BIOLOGICAL CYBERNETICS   (Germany)

^b THE UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SAMPLING;

DATA SPACE; FINITE SAMPLES; NEW APPROACHES; NUMERICAL INTEGRATIONS; PERTURBATION THEORY; SAMPLE SIZES; SPECTRAL CLUSTERING; SPECTRAL CLUSTERING ALGORITHMS;

CLUSTERING ALGORITHMS;

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

References (19)

1. P. Anselone. Collectively compact operator approximation theory. Prentice-Hall, 1971.
2. M. Belkin and P. Niyogi. Using manifold structure for partially labeled classification. In Advances in Neural Information Processing Systems 15, 2003.
3. O. Chapelle, J.Weston, and B. Scholkopf. Cluster kernels for semi-supervised learning. In Advances in Neural Information Processing Systems 15, 2003.
4. F. Chatelin. Spectral Approximation of Linear Operators. Academic Press, 1983.
5. S. Guattery and G. L. Miller. On the quality of spectral separators. SIAM Journal of Matrix Anal. Appl., 19(3), 1998.
6. J. Hartigan. Statistical theory in clustering. Journal of classification, 2:63-76, 1985.
7. R. Kannan, S. Vempala, and A. Vetta. On clusterings - good, bad and spectral. Technical report, Computer Science Department, Yale University, 2000.
8. T. Kato. Perturbation theory for linear operators. Springer, Berlin, 1966.
9. M. Meila and J. Shi. A random walks view of spectral segmentation. In 8th International Workshop on Artificial Intelligence and Statistics, 2001.
10. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14, 2001.
11. D. Pollard. Strong consistency of k-means clustering. Ann. of Stat., 9(1):135-140, 1981.
12. D. Spielman and S. Teng. Spectral partitioning works: planar graphs and finite element meshes. In 37th Annual Symposium on Foundations of Computer Science, 1996.
13. A. v. d. Vaart and J. Wellner. Weak Convergence and Empirical Processes. Springer, 1996.
14. R. Van Driessche and D. Roose. An improved spectral bisection algorithm and its application to dynamic load balancing. Parallel Comput., 21(1), 1995.
15. U. von Luxburg. Statistical Learning with Similarity and Dissimilarity Functions. PhD thesis, draft, available at http://www.kyb.tuebingen.mpg.de/ule, 2004.
16. U. von Luxburg, O. Bousquet, and M. Belkin. On the convergence of spectral clustering on random samples: The normalized case. In COLT, 2004.
17. Y. Weiss. Segmentation using eigenvectors: A unifying view. In Proceedings of the International Conference on Computer Vision, pages 975-982, 1999.
18. D. Zhou, O. Bousquet, T. Lal, J.Weston, and B. Scholkopf. Learning with local and global consistency. In Advances in Neural Information Processing Systems 16, 2004.
19. X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using Gaussian fields and harmonic functions. In ICML, 2003.