Improved smoothed analysis of the k-means method

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 461-470

  Manthey, Bodo ^a   Röglin, Heiko ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

EXPECTED RUNNING TIME; K-MEANS METHOD; NUMBER OF DATUM; POLYNOMIAL BOUNDS; POLYNOMIAL-TIME; SMOOTHED ANALYSIS; STANDARD DEVIATION; THEORETICAL PERFORMANCE;

K-MEANS CLUSTERING;

EID: 70349088984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.51     Document Type: Conference Paper

References (13)

1. David Arthur. Smoothed analysis of the k-means method. Manuscript, 2008.
2. David Arthur and Sergei Vassilvitskii. How slow is the k-means method? In Nina Amenta and Otfried Cheong, editors, Proc of the 22nd ACM Symposium on Computational Geometry (SOCG), pages 144-153. ACM Press, 2006.
3. David Arthur and Sergei Vassilvitskii. Worst-case and smoothed analysis of the ICP algorithm, with an application to the k-means method. In Proc. of the 47th Ann. IEEE Symp. on Foundations of Comp. Science (FOCS), pages 153-164. IEEE Computer Society, 2006.
4. Mihai Bǎdoiu, Sariel Har-Peled, and Piotr Indyk. Approximate clustering via core-sets. In Proc. of the 34th Ann. ACM Symposium on Theory of Computing (STOC), pages 250-257. ACM Press, 2002.
5. Pavel Berkhin. Survey of clustering data mining techniques. Technical report, Accrue Software, San Jose, CA, USA, 2002.
6. Richard O. Duda, Peter E. Hart, and David G. Stork. Pattern Classification. John Wiley & Sons, 2000.
7. Sariel Har-Peled and Bardia Sadri. How fast is the k-means method? Algorithmica, 41(3):185-202, 2005.
8. Mary Inaba, Naoki Katoh, and Hiroshi Imai. Variance-based k-clustering algorithms by Voronoi diagrams and randomization. IEICE Transactions on Information and Systems, E83-D(6):1199-1206, 2000. (Pubitemid 30884852)
9. Amit Kumar, Yogish Sabharwal, and Sandeep 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 Comp. Science (FOCS), pages 454-462, 2004. (Pubitemid 40575306)
10. Stuart P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-137, 1982.
11. Jiří Matoušek. On approximate geometric k-clustering. Discrete and Computational Geometry, 24(1):61-84, 2000.
12. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385-463, 2004.
13. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms and heuristics: Progress and open questions. In Luis M. Pardo, Allan Pinkus, Endre Süli, and Michael J. Todd, editors, Foundations of Computational Mathematics, Santander 2005, pages 274-342. Cambridge University Press, 2006.