Clustering large graphs via the Singular Value Decomposition

Machine Learning

Volumn 56, Issue 1-3, 2004, Pages 9-33

  Drineas, P ^a   Frieze, A ^b   Kannan, R ^c   Vempala, S ^d   Vinay, V ^e  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c Yale University   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

k means clustering; Randomized algorithms; Singular Value Decomposition

Indexed keywords

AZUMAS INEQUALITY; K-MEANS CLUSTERING; RANDOMIZED ALGORITHMS; SINGULAR VALUE DECOMPOSITION (SVD);

ALGORITHMS; GRAPH THEORY; IMAGE PROCESSING; INFORMATION RETRIEVAL SYSTEMS; INTEGRAL EQUATIONS; LINEAR ALGEBRA; MATRIX ALGEBRA; POLYNOMIAL APPROXIMATION; PROBABILITY; VECTORS;

LEARNING SYSTEMS;

EID: 3142750484     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MACH.0000033113.59016.96     Document Type: Article

References (27)

1. Achlioptas, D., & McSherry, F. (2001). Fast computation of low rank approximations. In Proceedings of the 33rd Annual Symposium on Theory of Computing (pp. 337-346).
2. Achlioptas, D., & McSherry, F. (2003). Fast computation of low rank matrix approximations. Manuscript.
3. Andrews, H. C., & Patterson, C. L. (1976a). Singular value decomposition image coding. IEEE Trans. on Communications, 4, 425-432.
4. Andrews, H. C., & Patterson, C. L. (1976b). Singular value decompositions and digital image processing. IEEE Trans. ASSP, 26-53.
5. Azar, Y., Fiat, A., Karlin, A., McSherry, F., & Saia, J. (2001). Spectral analysis of data. In Proc. of the 33rd ACM Symposium on Theory of Computing (pp. 619-626).
6. Berry, M. J., & Linoff, G. (1997). Data mining techniques. John-Wiley.
7. Bar-Yossef, Z. (2002). The complexity of massive dataset computations. Ph.D. thesis, University of California, Berkeley.
8. Bar-Yossef, Z. (2003). Sampling lower bounds via information theory. In Proceedings of the 35th Annual Symposium on Theory of Computing (pp. 335-344).
9. Charikar, M., & Guha, S. (1999). Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (pp. 378-388).
10. Charikar, M., Guha, S., Shmoys, D., & Tardos, E. (2002). A constant factor approximation algorithm for the k-median problem. Journal of Computer and System Sciences, 65:1, 129-149.
11. Drineas, P., & Kannan, R. (2001). Fast Monte-Carlo algorithms for approximate matrix multiplication. In Proceedings of the 42nd Annual Symposium on Foundations of Computer Science (pp. 452-459).
12. Frieze, A., Kannan, R., & Vempala, S. (1998). Fast Monte-Carlo algorithms for finding low rank approximations. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (pp. 370-378).
13. Furedi, Z., & Komlos, J. (1981). The eigenvalues of random symmetric matrices. Combinatorica, 1, 233-241.
14. Gersho, A., & Gray, R. M. (1991). Vector quantisation and signal compression. Kluwer Academic.
15. Gibson, D., Kleinberg, J., & Raghavan, P. (1998). Clustering categorical data: An approach based on dynamical systems. Very Large Data Bases (VLDB), 311-322.
16. Goldreich, O., Goldwasser, S., & Ron, D. (1998). Property testing and its connection to learning and approximation. Journal of the ACM, 5:4, 653-750.
17. Golub, G., & Van Loan, C. (1989). Matrix computations. Johns Hopkins University Press.
18. Huang, T., & Narendra, P. (1974). Image restoration by singular value decomposition. Applied Optics, 14:9, 2213-2216.
19. Jain, A. K., & Dubes, R. C. (1988). Algorithms for clustering data. Prentice Hall.
20. Jain, K., & Vazirani, V. (1999). Primal-dual approximation algorithms for metric facility location and k-median problems. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (pp. 2-13).
21. Jambu, M., & Lebeaux, M.-O. (1983). Cluster analysis and data analysis. North Holland.
22. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2000). The analysis of a simple k-means clustering algorithm. In Symposium on Computational Geometry (pp. 100-109).
23. Kleinberg, J. (1998). Authoritative sources in a hyperlinked environment. In Proceedings of 9th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 668-677).
24. McDiarmid, C. J. H. (1989). On the method of bounded differences. In Surveys in Combinatorics: Invited Papers at the 12th British Combinatorial Conference (pp. 148-188).
25. Ostrovsky, R., & Rabani, Y. (2002). Polynomial time approximation schemes for geometric k-clustering. Journal of the ACM, 49:2, 139-156.
26. Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000). Latent semantic indexing: A probabilistic analysis. Journal of Computer and System Sciences, 61:2, 217-235.
27. Parlett, B. (1997). The symmetric eigenvalue problem. Classics in Applied Mathematics, SIAM.