On clusterings: Good, bad and spectral

Journal of the ACM

Volumn 51, Issue 3, 2004, Pages 497-515

  Kannan, Ravi ^a,c   Vempala, Santosh ^b   Vetta, Adrian ^b  

^a YALE UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Yale University   (United States)

Author keywords

Clustering; Graph algorithms; Spectral methods

Indexed keywords

CLUSTERING; GRAPH ALGORITHMS; SPECTRAL METHODS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

SPECTRUM ANALYSIS;

EID: 4243128193     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/990308.990313     Document Type: Article

References (20)

1. ALPERT, C., KAHNG, A., AND YAO, Z. 1999. Spectral partitioning: The more eigenvectors the better. Discr. Appl. Math. 90, 3-26.
2. AZAR, Y., FIAT, A., KARLIN, A., MCSHERRY F., AND SAIA, J. 2001. Spectral analysis of data. In Proceedings of 33rd Symposium on Theory of Computing, ACM, New York, 619-626.
3. 2) time. In Proceedings of 28th Symposium on Theory of Computing. ACM, New York, 47-55.
4. CHARIKAR, M., CHEKURI, C., FEDER, T., AND MOTWANI, R. 1997. Incremental clustering and dynamic information retrieval. In Proceedings of 29th Symposium on Theory of Computing. ACM, New York, 626-635.
5. CHARIKAR, M., GUHA, S., SHMOYS, D., AND TARDOS, E. 1999. A constant-factor approximation for the k-median problem. In Proceedings of 31st Symposium on Theory of Computing. ACM, New York, 1-10.
6. CHENG, D., KANNAN, R., VEMPALA, S., AND WANG, G. 2003. On a recursive spectral algorithm for clustering from pairwise similarities. MIT LCS Technical Report MIT-LCS-TR-906.
7. DHILLON, I. 2001. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of the 7th ACM Conference on Knowledge Discovery and Data Mining. ACM, New York, 269-274.
8. DRINEAS, P., FRIEZE, A., KANNAN, R., VEMPALA, S., AND VINAY, V. 1999. Clustering in large graphs and matrices. Proceedings of 10th Symposium on Discrete Algorithms. ACM, New York, 291-299.
9. DYER, M., AND FRIEZE, A. 1985. A simple heuristic for the p-center problem. Oper. Res. Lett. 3(6), 285-288.
10. EIGENCLUSTER See http://www-math.mit.edu/cluster/.
11. FRIEZE, A., KANNAN, R., AND VEMPALA, S. 1998. Fast Monte-Carlo algorithms for finding low-rank approximations, In Proceedings of 39th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif, 370-378.
12. GAREY, M., AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, Calif.
13. INDYK, P., 1999. A sublinear time approximation scheme for clustering in metric spaces, In Proceedings of 40th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., 154-159.
14. JAIN, K., AND VAZIRANI, V. 2001. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation. ACM 48, 2, 274-296.
15. LEIGHTON, T., AND RAO, S. 1999. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46, 6, 787-832.
16. PAPADIMITRIOU, C., RAGHAVAN, P., TAMAKI, H., AND VEMPALA, S. 2000. Latent semantic indexing: a probabilistic analysis, J. Comput. Syst. Sci., 61, 217-235.
17. SHI, J., AND MALIK, J. 2000. Normalized cuts and image segmentation. IEEE Trans. Patt. Anal. Mach. Intell., 22, 8, 888-905, (See http://www-2.cs.cmu.edu/ ~jshi/Grouping/.)
18. SINCLAIR, A., AND JERRUM, M. 1989. Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82, 93-133.
19. STEWART, G. 1973. Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Rev. 154, 727-764.
20. WEISS, Y. 1999. Segmentation using eigenvectors: A unifying view. In Proceedings of IEEE International Conference on Computer Vision. IEEE Computer Society Press, Los Alamitos, Calif., 975-982.