A PTAS for k-means clustering based on weak coresets

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2007, Pages 11-18

  Feldman, Dan ^a   Monemizadeh, Morteza ^b   Sohler, Christian ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Approximation; Coresets; Geometric optimization; K mean

Indexed keywords

APPROXIMATION THEORY; CLUSTERING ALGORITHMS; COMPUTATIONAL GEOMETRY; FUNCTION EVALUATION; OPTIMIZATION; PROBLEM SOLVING;

BYASSIGNING POINTS; CORESETS; GEOMETRIC OPTIMIZATION; K-MEAN;

SET THEORY;

EID: 35348830377     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1247069.1247072     Document Type: Conference Paper

References (19)

1. J.L. Bentley and J.B. Saxe. Decomposable searching problems I: Static-to-dynamic transformation. J. Algorithms, 1(4):301-358. 1980, pages 301-358, 1980.
2. M. Bädoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. Proc. 34th Annu. ACM Sympos. Theory Comput. (STOC), pages 396-407, 2002.
3. K. Chen. On k-Median clustering in high dimensions. Proc. 17th Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), pages 1177-1185, 2006.
4. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani. Approximation schemes for clustering problems. Proc. 35th Annu. ACM Sympos. Theory Comput. (STOC), pages 50-58, 2003.
5. M. Effros and L.J. Schulman. Deterministic clustering with data nets. Report TR04-085, Elec. Colloq. Comp. Complexity, http://www.eccc.uni-trier.de/ eccc-reports/2004/TR04-085, 2003.
6. D. Feldman, A. Fiat, and M. Sharir. Coresets for weighted facilities and their applications. Proc. 47th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), 2006.
7. G. Frahling and C. Sohler. Coresets in dynamic geometric data streams. Proc. 37th Annu. ACM Sympos. Theory Comput. (STOC), pages 209-217, 2005.
8. D. Haussler. Decision theoretic generalizations of the pac model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
9. S. Har-Peled and A. Kushal. Smaller coresets for k-median and k-means clustering. Proc. 21st Annu. ACM Sympos. Comput. Geom. (SOCG), pages 126-134, 2005.
10. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. Proc. 36th Annu. ACM Sympos. Theory Comput. (STOC), pages 291-300, 2004.
11. S. Har-Peled and K. R. Varadarajan. Approximation schemes for clustering problems. Proc. 18th Annu. ACM Sympos. Comput. Geom.(SoCG), pages 312-318, 2002.
12. M. Inaba, N. Katoh, and H. Imai. Applications of weighted voronoi diagrams and randomization to variance-based k-clustering. Proc. 10th Annu. ACM Sympos. Comput. Geom.(SoCG), pages 332-339, 1994.
13. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1 + ε) -approximation algorithm, for k-means clustering in any dimensions. Proc. 45th Annual Symposium on Foundations of Computer Science, pages 454-462, 2004.
14. A. Kumar, Y. Sabharwal, and S. Sen. Linear time algorithms for clustering problems in any dimensions. Proc. 32nd Annual Internat. Colloquium on Automata, Languages, and Programming (ICALP), pages 1374-1385, 2005.
15. S. Lloyd. Least squares quantization in pcm. IEEE Transactions on Information Theory, 28:129-137, 1982.
16. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
17. J. Matousek. On approximate geometric k-clustering. Discrete Comput. Geom., 24:61-84, 2000.
18. R.R. Menu and C.G. Plaxton. Optimal time bounds for approximate clustering. Machine Learning, 56:35-60, 2004.
19. R. Ostrovsky, Y. Rabani, L. Shulman, and C. Swamy. The effectiveness of lloyd-type methods for the k-means problem. Proc. 47th Annu. IEEE Sympos. Found. Comput. Sci. (FOCS), 2006.