Clustering with spectral norm and the k-means algorithm

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2010, Pages 299-308

  Kumar, Amit ^a   Kannan, Ravindran ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b MICROSOFT RESEARCH INDIA   (India)

Author keywords

[No Author keywords available]

Indexed keywords

MIXTURES; PROBABILITY DISTRIBUTIONS; STATISTICS;

CLUSTER CENTERS; CLUSTERING DATA; GENERATIVE MODEL; MIXTURE OF DISTRIBUTIONS; NEW RESULTS; SEPARATION CONDITION; SPECTRAL NORMS; STANDARD DEVIATION;

K-MEANS CLUSTERING;

EID: 78751511258     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2010.35     Document Type: Conference Paper

References (25)

1. R. Kannan and S. Vempala, "Spectral algorithms," Foundations and Trends in Theoretical Computer Science, vol. 4, no. 3-4, pp. 157-288, 2009.
2. S. Lloyd, "Least squares quantization in PCM," IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 129-137, 1982.
3. R. Ostrovsky, Y. Rabani, L. J. Schulman, and C. Swamy, "The effectiveness of lloyd-type methods for the k-means problem," in Proc. 47th IEEE FOCS, 2006, pp. 165-176.
4. D. Arthur and S. Vassilvitskii, "How slow is the k-means method?" in Proc. 22nd Annual Symposium on Computational Geometry, 2006, pp. 144-153.
5. S. Dasgupta, "How fast is -means?" in Proc. 16th Annual Conference on Learning Theory, 2003, p. 735.
6. S. Har-Peled and B. Sadri, "How fast is the k-means method?" in Proc. ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 877-885.
7. A. P. Dempster, N. M. Laird, and D. B. Rubin, "Maximum likelihood from incomplete data via the em algorithm," Journal of the Royal Statistical Society, Series B, vol. 39, no. 1, pp. 1-38, 1977.
8. S. Dasgupta, "Learning mixtures of gaussians," in Proc. 40th IEEE FOCS, 1999, pp. 634-644.
9. S. Dasgupta and L. J. Schulman, "A probabilistic analysis of em for mixtures of separated, spherical gaussians," Journal of Machine Learning Research, vol. 8, pp. 203-226, 2007.
10. S. Arora and R. Kannan, "Learning mixtures of arbitrary gaussians," in Proc. 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 247-257.
11. S. Vempala and G. Wang, "A spectral algorithm for learning mixture models," J. Comput. Syst. Sci., vol. 68, no. 4, pp. 841-860, 2004.
12. D. Achlioptas and F. McSherry, "On spectral learning of mixtures of distributions," in Proc. 18th Annual Conference on Learning Theory, 2005, pp. 458-469.
13. R. Kannan, H. Salmasian, and S. Vempala, "The spectral method for general mixture models," SIAM J. Comput., vol. 38, no. 3, pp. 1141-1156, 2008.
14. S. C. Brubaker and S. Vempala, "Isotropic PCA and affine-invariant clustering," in Proc 49th IEEE FOCS, 2008, pp. 551-560.
15. S. Vempala, "Learning convex concepts from gaussian distributions with pca," To appear in IEEE FOCS, 2010.
16. A. Dasgupta, J. E. Hopcroft, J. M. Kleinberg, and M. Sandler, "On learning mixtures of heavy-tailed distributions," in Proc. 46th IEEE FOCS, 2005, pp. 491-500.
17. K. Chaudhuri and S. Rao, "Beyond gaussians: Spectral methods for learning mixtures of heavy-tailed distributions," in Proc. 24th Annual Conference on Learning Theory, 2008, pp. 21-32.
18. A. Dasgupta, J. E. Hopcroft, R. Kannan, and P. P. Mitra, "Spectral clustering with limited independence," in Proc. ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1036-1045.
19. F. McSherry, "Spectral partitioning of random graphs," in Proc. 42nd IEEE FOCS, 2001, pp. 529-537.
20. M.-F. Balcan, A. Blum, and A. Gupta, "Approximate clustering without the approximation," in Proc. ACM-SIAM Symposium on Discrete Algorithms, 2009, pp. 1068-1077.
21. M.-F. Balcan, A. Blum, and S. Vempala, "A discriminative framework for clustering via similarity functions," in Proc. 40th Annual ACM Symposium on Theory of Computing, 2008, pp. 671-680.
22. A. Kumar, Y. Sabharwal, and S. Sen, "Linear-time approximation schemes for clustering problems in any dimensions," J. ACM, vol. 57, no. 2, 2010.
23. D. Arthur and S. Vassilvitskii, "k-means++: the advantages of careful seeding," in ACM-SIAM Symposium on Discrete Algorithms, 2007, pp. 1027-1035.
24. A. Aggarwal, A. Deshpande, and R. Kannan, "Adaptive sampling for k-means clustering," in APPROX-RANDOM, 2009, pp. 15-28.
25. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, "A local search approximation algorithm for k-means clustering," in Proc. 18th Annual Symposium on Computational Geometry, 2002, pp. 10-18.