K-means has polynomial smoothed complexity

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

Volumn , Issue , 2009, Pages 405-414

  Arthur, David ^a   Manthey, Bodo ^b   Röglin, Heiko ^c  

^a Stanford University   (United States)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c MAASTRICHT UNIVERSITY   (Netherlands)

Author keywords

Clustering; K means; Smoothed analysis

Indexed keywords

DATA POINTS; GAUSSIANS; INPUT DATAS; INPUT SET; K-MEANS; K-MEANS METHOD; NUMBER OF ITERATIONS; POLYNOMIAL-TIME; RUNNING TIME; SMOOTHED ANALYSIS; STANDARD DEVIATION;

CLUSTERING ALGORITHMS; COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; POLYNOMIAL APPROXIMATION;

CLUSTER ANALYSIS;

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

References (27)

1. M. R. Ackermann and J. Blömer, "Coresets and approximate clustering for Bregman divergences," in Proc. of the 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2009, pp. 1088-1097.
2. M. R. Ackermann, J. Blömer, and C. Sohler, "Clustering for metric and non-metric distance measures," in Proc. of the 19th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2008, pp. 799-808.
3. D. Arthur and S. Vassilvitskii, "How slow is the k-means method?" in Proc. of the 22nd ACM Symp. on Computational Geometry (SoCG), 2006, pp. 144-153.
4. -, "k-means++: The advantages of careful seeding," in Proc. of the 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007, pp. 1027-1035.
5. -, "Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method," SIAM Journal on Computing, vol. 39, no. 2, pp. 766-782, 2009.
6. M. Bǎdoiu, S. Har-Peled, and P. Indyk, "Approximate clustering via core-sets," in Proc. of the 34th Ann. ACM Symp. on Theory of Computing (STOC), 2002, pp. 250-257.
7. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, "Clustering with Bregman divergences," Journal of Machine Learning Research, vol. 6, pp. 1705-1749, 2005.
8. L. Becchetti, S. Leonardi, A. Marchetti-Spaccamela, G. Schäfer, and T. Vredeveld, "Average case and smoothed competitive analysis of the multilevel feedback algorithm," Mathematics of Operations Research, vol. 31, no. 1, pp. 85-108, 2006.
9. R. Beier and B. Vöcking, "Random knapsack in expected polynomial time," Journal of Computer and System Sciences, vol. 69, no. 3, pp. 306-329, 2004.
10. P. Berkhin, "Survey of clustering data mining techniques," Accrue Software, San Jose, CA, USA, Technical Report, 2002.
11. R. O. Duda, P. E. Hart, and D. G. Stork, Pattern Classification. John Wiley & Sons, 2000.
12. M. Englert, H. Röglin, and B. Vöcking, "Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP," in Proc. of the 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007, pp. 1295-1304.
13. S. R. Gaddam, V. V. Phoha, and K. S. Balagani, "K-Means+ID3: A novel method for supervised anomaly detection by cascading K-Means clustering and ID3 decision tree learning methods," IEEE Transactions on Knowledge and Data Engineering, vol. 19, no. 3, pp. 345-354, 2007.
14. S. Har-Peled and B. Sadri, "How fast is the k-means method?" Algorithmica, vol. 41, no. 3, pp. 185-202, 2005. (Pubitemid 40062726)
15. M. Inaba, N. Katoh, and H. Imai, "Variance-based k-clustering algorithms by Voronoi diagrams and randomization," IEICE Transactions on Information and Systems, vol. E83-D, no. 6, pp. 1199-1206, 2000.
16. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu, "An efficient k-means clustering algorithm: Analysis and implementation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 881-892, 2002. (Pubitemid 34835464)
17. -, "A local search approximation algorithm for k-means clustering," Computational Geometry: Theory and Applications, vol. 28, no. 2-3, pp. 89-112, 2004.
18. A. Kumar, Y. Sabharwal, and S. Sen, "A simple linear time (1 + ∈)-approximation algorithm for k-means clustering in any dimensions," in Proc. of the 45th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), 2004, pp. 454-462.
19. S. P. Lloyd, "Least squares quantization in PCM," IEEE Transactions on Information Theory, vol. 28, no. 2, pp. 129-137, 1982.
20. B. Manthey and H. Röglin, "Improved smoothed analysis of the k-means method," in Proc. of the 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2009, pp. 461-470.
21. J. Matoušek, "On approximate geometric k-clustering," Discrete and Computational Geometry, vol. 24, no. 1, pp. 61-84, 2000.
22. R. Ostrovsky, Y. Rabani, L. Schulman, and C. Swamy, "The effectiveness of Lloyd-type methods for the k-means problem," in Proc. of the 47th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), 2006, pp. 165-176.
23. D. A. Spielman and S.-H. Teng, "Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time," Journal of the ACM, vol. 51, no. 3, pp. 385-463, 2004.
24. A. Vattani, "k-means requires exponentially many iterations even in the plane," in Proc. of the 25th ACM Symp. on Computational Geometry (SoCG), 2009, pp. 324-332.
25. R. Vershynin, "Beyond Hirsch conjecture: Walks on random polytopes and smoothed complexity of the simplex method," SIAM Journal on Computing, vol. 39, no. 2, pp. 646-678, 2009.
26. K. L. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl, "Constrained k-means clustering with background knowledge," in Proc. of the 18th International Conference on Machine Learning (ICML). Morgan Kaufmann, 2001, pp. 577-584.
27. H. E. Warren, "Lower bounds for approximation by nonlinear manifolds," Transactions of the American Mathematical Society, vol. 133, no. 1, pp. 167-178, 1968.