Spectral clustering by recursive partitioning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 256-267

  Dasgupta, Anirban ^a   Hopcroft, John ^b   Kannan, Ravi ^c   Mitra, Pradipta ^c  

^a YAHOO RESEARCH   (United States)

^b Department of Obstetrics Gynecology   (United States)

^c YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; PROBLEM SOLVING; RANDOM PROCESSES; RECURSIVE FUNCTIONS;

CLUSTER SEPARATION; CLUSTERING PROBLEMS; PARTITIONING; SPECTRAL CLUSTERING;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 33750692681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_25     Document Type: Conference Paper

References (23)

1. Dimitris Achlioptas and Frank McSherry, On spectral learning of mixtures of distributions, Conference on Learning Theory (COLT) 2005, 458-469.
2. Noga Alon, Eigenvalues and expanders, Combinatorica, 6(2), (1986) , 83-96,
3. Noga Alon and Nabil Kahale, A spectral technique for coloring random S-colorable graphs, SIAM Journal on Computing 26 (1997), n. 6. 1733-1748.
4. nd annual ACM Symposium on Theory of computing (2001), 619-626.
5. th IEEE Symposium on Foundations of Computer Science (1987).
6. Thang Bui, Soma Chaudhuri, Tom Leighton and Mike Sipser, Graph bisection algorithms with good average case behavior, Combinatorica, 7, 1987, 171-191.
7. th ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (PODS), 196 - 205.
8. th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005.
9. rd International Colloquium, ICALP, Lecture Notes in Computer Science 4051 Springer 2006.
10. nd IEEE Symposium on Foundations of Computer Science (2004), 602-610.
11. th IEEE Symposium on Foundations of Computer Science (1986), 331-336
12. Uriel Feige and Eran Ofek, Spectral techniques applied to sparse random graphs, Random Structures and Algorithms, 27(2), 251-275, September 2005.
13. M Fiedler, Algebraic connectibility of graphs, Czechoslovak Mathematical Journal, 23(98), (1973), 298-305.
14. st annual ACM Symposium on Theory of computing (1989), 587 - 598.
15. Zoltan Furedi and Janos Komlos, The eigenvalues of random symmetric matrices, Combinatorica 1, 3, (1981), 233-241.
16. G. Golub, C. Van Loan (1996), Matrix computations, third edition, The Johns Hopkins University Press Ltd., London.
17. Ravi Kannan, Santosh Vempala and Adrian Vetta, On Clusterings : Good, bad and spectral, Proceedings of the Symposium on Foundations of Computer Science (2000), 497 - 515.
18. nd IEEE Symposium on Foundations of Computer Science (2001), 529-537.
19. th annual ACM Symposium on Theory of computing (1988), 235-244.
20. Daniel Spielman and Shang-hua Teng, Spectral Partitioning Works: Planar graphs and finite element meshes, Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS '96), 96 - 105.
21. Deepak Verma and Marina Meila, A comparison of spectral clustering algorithms, TR UW-CSE-03-05-01, Department of Computer Science and Engineering, University of Washington (2005).
22. th annual ACM Symposium on Theory of computing (2005), 619-626.
23. Ying Zhao and George Karypis, Evaluation of hierarchical clustering algorithms for document datasets, Proc. of the 11 International Conference on Information and Knowledge Management (2002), 515 - 524.