k-means Requires Exponentially Many Iterations Even in the Plane

Discrete and Computational Geometry

Volumn 45, Issue 4, 2011, Pages 596-616

  Vattani, Andrea ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

k means; Local search; Lower bounds

Indexed keywords

EID: 79954632157     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-011-9340-1     Document Type: Article

References (17)

1. Agarwal, P. K., Mustafa, N. H.: k-means projective clustering. In: Proceedings of the 23rd Symposium on Principles of Database Systems, pp. 155-165 (2004).
2. Arthur, D., Vassilvitskii, S.: How slow is the k-means method. In: Proceedings of the 22nd Annual Symposium on Computational Geometry, pp. 144-153 (2006).
3. Arthur, D., Vassilvitskii, S.: Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. SIAM J. Comput. 39(2), 766-782 (2009).
4. Arthur, D., Manthey, B., Röglin, H.: k-means has polynomial smoothed complexity. In: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (2009).
5. Berkhin, P.: Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, USA (2002).
6. Duda, R. O., Hart, P. E., Stork, D. G.: Pattern Classification. Wiley, New York (2000).
7. Forgy, E. W.: Cluster analysis of multivariate data: efficiency versus interpretability of classifications. In: Biometric Society Meeting, Riverside, California, 1965. Abstract in Biometrics, vol. 21, p. 768 (1965).
8. Gibou, F., Fedkiw, R.: A fast hybrid k-means level set algorithm for segmentation. In: Proceedings of the 4th Annual Hawaii International Conference on Statistics and Mathematics, pp. 281-291 (2005).
9. Har-Peled, S., Sadri, B.: How fast is the k-means method? Algorithmica 41(3), 185-202 (2005).
10. Inaba, M., Katoh, N., Imai, H.: Variance-based k-clustering algorithms by Voronoi diagrams and randomization. IEICE Trans. Inf. Syst. E83-D(6), 1199-1206 (2000).
11. Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., Wu, A. Y.: A local search approximation algorithm for k-means clustering. Comput. Geom. 28(2-3), 89-112 (2004).
12. Lloyd, S. P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129-136 (1982).
13. MacQueen, J. B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281-297 (1967).
14. Manthey, B., Röglin, H.: Improved smoothed analysis of the k-means method. In: Proceedings of the 20th Annual Symposium on Discrete Algorithms, pp. 461-470 (2009).
15. Spielman, D. A., Teng, S.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51(3), 385-463 (2004).
16. Vattani, A.: k-means requires exponentially many iterations even in the plane. In: Proceedings of the 25th Annual Symposium on Computational Geometry, pp. 324-332. (2009).
17. Vattani, A.: k-means lower bound implementation, www. cse. ucsd. edu/~avattani/k-means/lowerbound. py.