Sublinear-time approximation algorithms for clustering via random sampling

Random Structures and Algorithms

Volumn 30, Issue 1-2, 2007, Pages 226-256

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Clustering; k means; k median; Min sum clustering; Random sampling

Indexed keywords

EID: 33846677514     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20157     Document Type: Conference Paper

References (31)

1. S. Arora, P. Raghavan, and S. Rao, Approximation schemes for Euclidean k-medians and related problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), 1998, pp. 106-113.
2. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit, Local search heuristics for k-median and facility location problems, SLAM J Computing 33 (2004), 544-562.
3. M. Bǎdoiu, S. Har-Peled, and P. Indyk, Approximate clustering via core-sets. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), 2002, pp. 250-257.
4. Y. Bartal, M. Charikar, and D. Raz, Approximating min-sum k-clustering in metric spaces. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), 2001, pp. 11-20.
5. M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 378-388.
6. M. Charikar, S. Guha, É. Tardos, and D. B. Shmoys, A constant-factor approximation algorithm for the k-median problem, J Comput System Sci 65 (2002), 129-149.
7. M. Charikar, L. O'Callaghan, and R. Panigrahy, Better streaming algorithms for clustering problems. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 30-39.
8. B. Chazelle, Who says you have to look at the input? The brave new world of sublinear computing? In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004, p. 134.
9. A. Czumaj and C. Sohler, Abstract combinatorial programs and efficient property testers, SIAM J Computing 34 (2005), 580-615.
10. J. Fakcharoenphol, S. Rao, and K. Talwar, A tight bound on approximating arbitrary metrics by tree metrics, J Comput System Sci 69 (2004), 485-497.
11. W. Fernandez de la Vega, M. Karpinski, C. Kenyon, and Y. Rabani, Approximation schemes for clustering problems. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), 2003, pp. 50-58.
12. G. Frahling and C. Sohler, Coresets in dynamic geometric data streams. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), 2005, pp. 209-217.
13. N. Gutmann-Beck and R. Hassin, Approximation algorithms for min-sump-clustering, Discrete Appl Math 89 (1998), 125-142.
14. S. Har-Peled and S. Mazumdar, On coresets for k-means and k-median clustering, In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004, pp. 291-300.
15. M. Inaba, N. Katoh, and H. Imai, Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. In Proceedings of the 10th Annual ACM Symposium on Computational Geometry, 1994, pp. 332-339.
16. P. Indyk, Sublinear time algorithms for metric space problems. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), 1999, pp. 428-434.
17. P. Indyk, A sublinear time approximation scheme for clustering in metric spaces. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999, pp. 154-159.
18. P. Indyk, High-Dimensional Computational Geometry, PhD Dissertation, Stanford University, 2000.
19. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani, Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP, J ACM 50(6) (2003), 795-824.
20. K. Jain and V. V. Vazirani, Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation, J ACM 48 (2001), 274-296.
21. S. G. Kolliopoulos and S. Rao, A nearly linear-time approximation scheme for the Euclidean k-median problems. In Proceedings of the 7th Annual European Symposium on Algorithms (ESA), 1999, pp. 378-389.
22. A. Kumar, Y. Sabharwal, and S. Sen, A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensions. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), 2004, pp. 454-462.
23. A. Kumar, Y. Sabharwal, and S. Sen, Linear time algorithms for clustering problems in any dimensions. In Proceedings of the 32nd Annual International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 1374-1385.
24. R. Kumar and R. Rubinfeld, Sublinear time algorithms, SIGACT News 34(4) (2003), 57-67.
25. J. Matoušek, On approximate geometric k-clustering, Discrete Computational Geometry 24 (2000), 61-84.
26. R. R. Mettu and C. G. Plaxton, Optimal time bounds for approximate clustering, Machine Learn 56(1-3) (2004), 35-60.
27. A. Meyerson, L. O'Callaghan, and S. Plotkin, A k-median algorithm with running time independent of data size, Machine Learn 56(1-3) (2004), 61-87.
28. N. Mishra, D. Oblinger, and L. Pitt, Sublinear time approximate clustering. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 439-447.
29. L. J. Schulman, Clustering for edge-cost minimization. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), 2000, pp. 547-555.
30. S. Sahni and T. Gonzalez, P-complete approximation problems, J ACM 23 (1976), 555-566.
31. T. Tokuyama and J. Nakano, Geometric algorithms for the minimum cost assignment problem, Random Struct Algorithms 6 (1995), 393-406.