A linear time algorithm for approximate 2-means clustering

Computational Geometry: Theory and Applications

Volumn 32, Issue 2, 2005, Pages 159-172

  Sabharwal, Yogish ^a   Sen, Sandeep ^b,c  

^a IBM INDIA RESEARCH LAB   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^c INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

k means; Randomization

Indexed keywords

EID: 84867956990     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2005.01.003     Document Type: Article

References (11)

1. A. Broder, S. Glassman, M. Manasse, and G. Zweig Syntactic clustering of the web Proc. of 6th International World Wide Web Conference 1997
2. S.C. Deerwester, S.T. Dumais, T.K. Landauer, G.W. Furnas, and R.A. Harshman Indexing by latent semantic analysis J. Amer. Soc. Inform. Sci. 41 6 1990 391 407
3. Drineas, Frieze, Kannan, Vempala, Vinay, Clustering in large graphs and matrices, in: SODA: ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms), 1999
4. C. Faloutsos, R. Barber, M. Flickner, J. Hafner, W. Niblack, D. Petkovic, and W. Equitz Efficient and effective querying by image content J. Intell. Inf. Syst. 3 3-4 1994 231 262
5. M.R. Garey, and D.S. Johnson Computer and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman New York
6. S. Har-Peled, and S. Mazumdar On coresets for k-means and k-median clustering Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing 2004 ACM Press New York 291 300
7. M. Inaba, N. Katoh, and H. Imai Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering (extended abstract) Proceedings of the Tenth Annual Symposium on Computational Geometry 1994 ACM Press New York 332 339
8. A. Kumar, Y. Sabharwal, and S. Sen A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensions Proceedings of the 45th Annual Symposium on Foundations of Computer Science 2004 IEEE Computer Society 454 462
9. J. Matousek On approximate geometric k-clustering Discrete Comput. Geom. 24 1 2000 61 84
10. N. Megiddo, and K.J. Supowit On the complexity of some common geometric location problems SIAM J. Comput. 13 1 1984 182 196
11. M.J. Swain, and D.H. Ballard Color indexing Internat. J. Computer Vision 1991 11 32