Smaller coresets for k-median and k-means clustering

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 126-134

  Har Peled, Sariel ^a   Kushal, Akash ^a  

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

Author keywords

Clustering; Coresets

Indexed keywords

COMBINATORIAL MATHEMATICS;

CLUSTERING; CORESETS; K-MEDIAN;

COMPUTATIONAL COMPLEXITY;

EID: 33244482464     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064114     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. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-median and related problems. In Proc. 30th Annu. ACM Sympos. Theory Comput., pages 106-113, 1998.
3. M. Bǎdoiu, S. Har-Peled, and P. Indyk. Approximate clustering via coresets. In Proc. 34th Annu. ACM Sympos. Theory Comput., pages 250-257, 2002.
4. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoys. A constant-factor approximation algorithm for the k-median problem. In Proc. 31st Annu. ACM Sympos. Theory Comput., pages 1-10, 1999.
5. 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.
6. R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness i: Basic results. SIAM J. Comput., 24(4):873-921, 1995.
7. M. Effros and L. J. Schulman. Deterministic clustering with data nets. Technical Report TR04-085, Elec. Colloq. Comp. Complexity, 2003. http://www.eccc.uni-trier.de/eccc-reports/2004/TR04-085/.
8. S. Guha, R. M. N. Mishra, and L. O'Callaghan. Clustering data streams. In Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci., pages 359-366, 2000.
9. 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.
10. 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.
11. 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.
12. S. G. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the euclidean k-median problem. In Proc. 7th Annu. European Sympos. Algorithms, pages 378-389, 1999.
13. A. Kumar, Y. Sabharwal, and S. Sen. Linear time algorithms for clustering problems in any dimension. manuscript, 2004.
14. J. Matoušek. On approximate geometric k-clustering. Discrete Comput. Geom., 24:61-84, 2000.
15. J. Matoušek. Lectures on Discrete Geometry. Springer, 2002.
16. R. Mettu and C. G. Plaxton. Optimal time bounds for approximate clustering. In In Proceedings of the 18th Conference on Uncertainty in Artifical Intelligence, pages 344-351, 2002.