Polynomial-time approximation schemes for geometric Min-Sum median clustering

Journal of the ACM

Volumn 49, Issue 2, 2002, Pages 139-156

  Ostrovsky, Rafail ^a   Rabani, Yuval ^b  

^a TELCORDIA TECHNOLOGIES   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING; GEOMETRIC SETTINGS; POLYNOMIAL-TIME APPROXIMATION; RANDOM LINEAR TRANSFORMATION;

APPROXIMATION THEORY; BINARY SEQUENCES; GEOMETRY; GRAPH THEORY; LINEAR SYSTEMS; MATHEMATICAL TRANSFORMATIONS;

POLYNOMIALS;

EID: 0037709221     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/506147.506149     Document Type: Article

References (41)

1. AGARWAL, P. K., AND PROCOPIUC, C. M. 1998. Exact and approximation algorithms for clustering. In Proceedings of the 9th Annual ACM - SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 658-667.
2. AGARWAL, P. K., AND SHARIR, M. 1998. Efficient algorithms for geometric optimization. ACM Comput. Sun: 30, 4, 412-458.
3. ALON, N., AND SPENCER, J. 1992. The Probabilistic Method. Wiley. New York.
4. ALON, N., AND SUDAKOV, B. 1999. On two segmentation problems. J. Algorithms 33, 173-184.
5. ARORA, S., KARGER, D., AND KARPINSKI, M. 1995. Polynomial-time approximation schemes for dense instances of NP-hard problems. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 284-293.
6. ARORA, S., RAGHAVAN, P., AND RAO, S. 1998. Approximation schemes for Euclidean k-medians and related problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 106-113.
7. BORODIN, A., OSTROVSKY, R., AND RABANI, Y. 1999. Subquadratic approximation algorithms for clustering problems in high dimensional spaces. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing. ACM, New York.
8. BRODER A., CLASSMAN, S., MANASSE, M., AND ZWEIG, G. 1997. Syntactic clustering of the Web. In Proceedings of the 6th International World Wide Web Conference. pp. 391-404.
9. BERRY, M. W., DUMAIS, S. T., AND O'BRIEN, G. W. 1995. Using linear algebra for intelligent information retrieval. SIAM Rev. 37, 4, 573-595.
10. BERN, M., AND EPPSTEIN, D. 1996. Approximation algorithms for geometric problems (Chapter 8). In Approximation Algorithms for Hard Problems, D. Hochbaum, Ed. PWS Publishing.
11. CHANDRASEKARAN, R., AND TAMIR, A. 1990. Algebraic optimization: The Fermat-Weber location problem. Math. Program. 46, 219-224.
12. CHARIKAR, M., AND GUHA, S. 1999. Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
13. CHARIKAR, M., GUHA, S., SHMOYS, D. B., AND TARDOS, É. 1999. A constant factor approximation algorithm for the k-median problem. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 1-10.
14. CUTTING, D. R., KARGER, D. R., AND PEDERSEN, J. O. 1993. Constant interaction-time scatter-gather browsing of very large document collections. In Proceedings of the 16th Annual International SIGIR Conference on Research and Development in Information Retrieval. ACM, New York.
15. CUTTING, D. R., KARGER, D. R., PEDERSEN, J. O., AND TUKEY, J. W. 1992. Scatter/gather: A cluster-based approach to browsing large document collections. In Proceedings of the 15th Annual International SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, pp. 318-329.
16. DASGUPTA, S. 1999. Learning mixtures of Gaussians. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
17. DE LA VEGA, W. F., AND KENYON, C. 1998. A randomized approximation scheme for metric MAX CUT. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 468-471.
18. DEERWESTER, S., DUMAIS, S. T., LANDAUER, T. K., FURNAS, G. W., AND HARSHMAN, R. A. 1990. Indexing by latent semantic analysis. J. Soc. Inf. Sci. 41, 6, 391-401.
19. DRINEAS, P., FRIEZE, A., KANNAN, R., VEMPALA, S., AND VINAY, V. 1999. Clustering in large graphs and matrices. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithm. ACM, New York, pp. 291-299.
20. DUMAIS, S. T. 1991. Improving the retrieval of information from external sources. Behav. Res. Meth. Iustrum. Comput. 23, 2, 229-236.
21. DUMAIS, S. T., FURNAS, G. W., LANDAUER, T. K., AND DEERWESTER, S. 1988. Using latent semantic analysis to improve information retrieval. In Proceedings of CHI '88. pp. 281-285.
22. FRANKL, P., AND MAEHARA, H. 1988. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory B 44, 355-362.
23. FRIEZE, A., AND KANNAN, R. 1996. The regularity lemma and approximation schemes for dense problems. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 12-20.
24. FRIEZE, A., KANNAN, R., AND VEMPALA, S. 1998. Fast Monte-Carlo algorithms for finding low-rank approximations. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 370-378.
25. GUHA, S., AND KHULLER, S. 1999. Greedy strikes back: Improved facility location algorithms. J. Algorithms 31, 1, 228-248.
26. INDYK, P. 1999. A sublinear time approximation scheme for clustering in metric spaces. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
27. INDYK, P., AND MOTWANI, R. 1998. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 604-613.
28. JAIN, K., AND VAZIRANI, V. V. 1999. Primal-dual approximation algorithms for metric facility location and k-median problems. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
29. JOHNSON, W. B., AND LINDENSTRAUSS, J. 1984. Extensions of Lipschitz mappings into Hilbert space. Contemp. Math. 26, 189-206.
30. KANNAN, R., VEMPALA, S., AND VETTA, A. 2000. On clusterings: Good, bad and spectral. In Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif.
31. KANNAN, R., AND VINAY, V. 2001. The Manjara Meta-Search Engine, http://cluster.cs.yale.edu/about.html.
32. KARP, R. M. 2000. The genomics revolution and its challenges for algorithmic research. Bull. EATCS 71 (June), 151-159.
33. KLEINBERG, J. 1997. Two algorithms for nearest-neighbor search in high dimensions. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 599-608.
34. KLEINBERG, J. 1999. Authoritative sources in a hyperlinked environment. J. ACM 46.
35. KLEINBERG, J., PAPADIMITRIOU, C., AND RAGHAVAN, P. 1998. Segmentation problems. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 473-482.
36. KUSHILEVITZ, E., OSTROVSKY, R., AND RABANI, Y. 2000. Efficient search for approximate nearest neighbor in high dimensional spaces. SIAM J. Comput. 30, 2, 457-474.
37. LINIAL, N., LONDON, E., AND RABINOVICH, Y. 1995. The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 2, 215-245.
38. RASMUSSEN, E. 1992. Clustering algorithms. In Information Retrieval. W. B. Frakes and R. Baeza-Yates, Eds. Prentice-Hall, Englewood Cliffs, N.J.
39. O'ROURKE, J., AND TOUSSAINT, G. 1997. Pattern recognition. In Handbook of Discrete and Computational Geometry. J. Goodman and J. O'Rourke, Eds. CRS Press, pp. 797-813.
40. SCHULMAN, L. J. 2000. Clustering for edge-cost minimization. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, pp. 547-555.
41. ZAMIR, O., ETZIONI, O., MADANI, O., AND KARP, R. M. 1997. Fast and intuitive clustering of web documents. In Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining. (Newport Beach, Calif., Aug.), D. Heckerman, H. Mannila, D. Pregibon, and R. Uthurusamy, Eds. AAAI Press, pp. 287-290.