A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensions

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

Volumn , Issue , 2004, Pages 454-462

  Kumar, Amit ^a   Sabharwal, Yogish ^a   Sen, Sandeep ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; NOTION OF DISTANCE; RANDOM SAMPLING; VORONOI PARTITIONS;

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; LINEAR SYSTEMS; PROBLEM SOLVING; RANDOM PROCESSES;

COMPUTER SCIENCE;

EID: 11244288693     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. S. Arora, P. Raghavan, and S. Rao. Approximation schemes for euclidean k-medians and related problems. In Proceedings of the thirtieth annual ACM symposium on Theory of computing, pages 106-113. ACM Press, 1998.
2. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 21-29. ACM Press, 2001.
3. M. Bādoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In Proceedings of the thiryfourth annual ACM symposium on Theory of computing, pages 250-257. ACM Press, 2002.
4. M. Bern and D. Eppstein. Approximation algorithms for geometric problems, pages 296-345, 1997.
5. A. Broder, S. Glassman, M. Manasse, and G. Zweig. Syntactic clustering of the web. In Proc. of 6th International World Wide Web Conference, 1997.
6. W. F. de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Approximation schemes for clustering problems. In Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pages 50-58. ACM Press, 2003.
7. S. Deerwester, S. Dumais, G. Furnas, T. Landauer, and R. Harshman. Indexing by latent semantic analysis, 1990.
8. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley-Interscience Publication, 2000.
9. 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):231-262, 1994.
10. S. Har-Peled and S. Mazumdar. On coresets for k-means and k-median clustering. In Proceedings of the thirty-sixth annual ACM symposium on Theory of computing, pages 291-300. ACM Press, 2004.
11. M. Inaba, N. Katoh, and H. Imai. Applications of weighted voronoi diagrams and randomization to variance-based k-clustering: (extended abstract). In Proceedings of the tenth annual symposium on Computational geometry, pages 332-339. ACM Press, 1994.
12. S. Kolliopoulos and S. Rao. A nearly linear time approximation scheme for the euclidean k-medians problem. In Proceedings of the 7th European Symposium on Algorithms, pages 326-371, 1999.
13. J. Matousek. On approximate geometric k-clustering. In Discrete and Computational Geometry, pages 61-84, 2000.
14. M. J. Swain and D. H. Ballard. Color indexing. In International Journal of Computer Vision, pages 11-32, 1991.