How fast is the k-means method?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 877-885

  Har Peled, Sariel ^a   Sadri, Bardia ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; ITERATIVE METHODS; PROBABILITY; SET THEORY;

COST FUNCTIONS; K-MEANS METHOD; POLYLOGARITHMIC NUMBERS; VORONOI PARTITIONS;

POLYNOMIAL APPROXIMATION;

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

References (16)

1. S. Arora. Polynomial time approximation schemes for euclidean tsp and other geometric problems. J. Assoc. Comput. Mach., 45(5):753-782, Sep 1998.
2. S. Dasgupta. How fast is k-means? In Proc. 16th Annu. Comp. Learn. Theo., number 2777 in Lect. Notes in Comp. Sci., page 735, 2003.
3. W. F. de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Approximation schemes for clustering problems. In Proc. 35th Annu. ACM Sympos. Theory Comput., pages 50-58, 2003.
4. Q. Du, V. Faber, and M. Gunzburger. Centroidal voronoi tessellations; Applications and algorithms. SIAM Review, 41(4):637-676, 1999.
5. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley-Interscience, New York, 2nd edition, 2001.
6. M. Effros and L. J. Schulman. Deterministic clustering with data nets. Manuscript, 2003.
7. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. In Proc. 36th Annu. ACM Sympos. Theory Comput., pages 291-300, 2004.
8. M. Inaba, N. Katoh, and H. Imai. Applications of weighted voronoi diagrams and randomization to variance-based k-clustering. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 332-339, 1994.
9. 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 Annu. ACM Sympos. Comput. Geom., pages 10-18, 2002.
10. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1+ε)-approximation algorithm for k-means clustering in any dimensions. In Proc. 45th Annu. IEEE Sympos. Found. Comput. Sci., page to appear, 2004.
11. S. Lloyd. Least squares quantization in pcm. IEEE Transactions on Information Theory, 28:129-137, 1982.
12. J. MacQueen. Some methods for classifications and analysis of multivariate observations. In Proc. fifth Berkeley symp. math. stat. and prob., pages 281-297. Unversity of California Press, Berkeley, 1967.
13. J. Matoušek. On approximate geometric k-clustering Discrete Comput. Geom., 24:61-84, 2000.
14. J. Matoušek. Lectures on Discrete Geometry. Springer, 2002.
15. D. Pollard. Strong consistency of k-means clustering. Annals of Statistics, 9:135-140, 1981.
16. B. Sadri. Lloyd's method and variants: implementation together with inputs, 2004. http://www.uiuc.edu/~sariel/papers/03/lloyd-kmeana.