Approximate clustering without the approximation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1068-1077

  Balcan, Maria Florina ^a   Blum, Avrim ^a   Gupta, Anupam ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; OPTIMAL SYSTEMS; OPTIMIZATION;

APPROXIMATION FACTOR; CLUSTERINGS; K-MEDIAN; METRIC SPACES; OBJECTIVE FUNCTIONS; OPTIMAL SOLUTIONS; POINT WISE; RESEARCH EFFORTS;

K-MEANS CLUSTERING;

EID: 70349129917     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.116     Document Type: Conference Paper

References (27)

1. +04] V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAM J. Comput., 33(3):544-562, 2004.
2. [AK05] S. Arora and R. Kannan. Learning mixtures of arbitrary gaussians. In Proc. 37th STOC, 2005.
3. [AM05] D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In COLT, 2005.
4. [ARR99] S. Arora, P. Raghavan, and S. Rao. Approximation schemes for Euclidean k-medians and related problems. In STOC, pages 106-113. 1999.
5. [AV06] D. Arthur and S. Vassilvitskii. Worst-case and smoothed analyses of the icp algorithm, with an application to the k-means method. In Proc. 47th FOCS, 2006.
6. [BBV08] M.-F. Balcan, A. Blum, and S. Vempala. A discrimantive framework for clustering via similarity functions. In Proc. 40th STOC, 2008.
7. [BCR01] Y. Bartal, M. Charikar, and D. Raz. Approximating minsum k-clustering in metric spaces. In Proc. 33rd STOC, 2001.
8. [BD07] S. Ben-David. A framework for statistical clustering with constant time approximation for k-median and k-means clustering. Mach. Learn., 66(2-3):243-257, 2007.
9. [CG99] M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proc. 4th FOCS, 1999.
10. [CGTS99] M. Charikar, S. Guha, E. Tardos, and D. B. Shmoy. A constant-factor approximation algorithm for the k-median problem. In STOC, 1999.
11. [CS04] A. Czumaj and C. Sohler. Sublinear-time approximation for clustering via random samples. In Proc. 31st ICALP, pages 396-407, 2004.
12. [Das99] S. Dasgupta. Learning mixtures of gaussians. In Proc. 40th FOCS, 1999.
13. [DGL96] L. Devroye, L. Gyorfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, 1996.
14. [DHS01] R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley, 2001.
15. [dlVKKR03] W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon, and Yuval Rabani. Approximation schemes for clustering problems. In Proc. 35th STOC, 2003.
16. [GK99] S. Guha and S. Khuller. Greedy strikes back: Improved algorithms for facility location. Journal of Algorithms, 31(1):228-248, 1999. (Pubitemid 129609603)
17. [Ind99] P. Indyk. Sublinear time algorithms for metric space problems. In Proc. 31st STOC, 1999.
18. [JMS02] K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In Proc. 34th STOC, 2002.
19. [JV01] K. Jain and V. V. Vazirani. Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and lagrangian relaxation. JACM, 48(2):274-296, 2001.
20. [KSS04] A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1 + ∈)-approximation algorithm for k-means clustering in any dimensions. In Proc. 45th FOCS, pages 454-462, Washington, DC, USA, 2004.
21. [KSV05] R. Kannan, H. Salmasian, and S. Vempala. The spectral method for general mixture models. In Proc. 18th COLT, 2005.
22. [Llo82] S.P. Lloyd. Least squares quantization in PCM. IEEE Trans. Inform. Theory, 28(2): 129-137, 1982.
23. [Mei06] M. Meila. The uniqueness of a good clustering for k-means. In Proc. 23rd ICML, 2006.
24. [MOP01] N. Mishra, D. Oblinger, and L. Pitt. Sublinear time approximate clustering. In SODA, pages 439-447, 2001.
25. [ORSS06] R. Ostrovsky, Y. Rabani, L. Schulman, and C. Swamy. The effectiveness of lloyd-lype methods for the k-means problem. In Proc. 47th FOCS, 2006.
26. [Sch00] L.J. Schulman. Clustering for edge-cost minimization. In Proc. STOC, pages 547-555, 2000.
27. [VW04] S. Vempala and G. Wang. A spectral algorithm for learning mixture models. JCSS, 68(2):841-860, 2004.