Linear-time approximation schemes for clustering problems in any dimensions

Journal of the ACM

Volumn 57, Issue 2, 2010, Pages

  Kumar, Amit ^a   Sabharwal, Yogish ^b   Sen, Sandeep ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b IBM RESEARCH INDIA   (India)

Author keywords

Approximation; Clustering; K means; K medians

Indexed keywords

ARBITRARY DIMENSION; CLUSTERING PROBLEMS; D DIMENSIONS; GENERAL APPROACH; GEOMETRIC CLUSTERING; K-MEANS; K-MEDIAN; LINEAR-TIME APPROXIMATION; RANDOMIZED ALGORITHMS; RUNNING TIME;

CLUSTERING ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 76849111564     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1667053.1667054     Document Type: Article

References (20)

1. ARORA, S. 1998.Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45, 5, 753-782.
2. ARORA, S., RAGHAVAN, P., AND RAO, S. 1998.Approximation schemes for euclidean k-medians and related problems. In Proceedings of the Annual ACMSymposium on Theory of Computing (STOC),ACM, New York, 106-113.
3. BADOIU, M., HAR-PELED, S., AND INDYK, P. 2002. Approximate clustering via core-sets. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), ACM, New York. 250-257.
4. BERN,M., ANDEPPSTEIN,D. 1996. Approximation algorithms for geometric problems. In Approximation Algorithms for Geometric Problems PWS Publishing, 296-345.
5. BRODER, A. Z., GLASSMAN, S. C., MANASSE, M. S., AND ZWEIG, G. 1997. Syntactic clustering of the web. Comput. Netw. 29, 8-13, 1157-1166.
6. CHEN, K. 2006. On-median clustering in high dimensions. In Proceedings of the Symposium on Discrete Algorithms, ACM, New York, 1177-1185.
7. DASGUPTA, S. 2007. The hardness of k-means clustering. Tech. Rep. CS2007.0890, University of California, San Diego, CA.
8. DE LA VEGA, W. F., KARPINSKI, M., KENYON, C., AND RABANI, Y. 2003. Approximation schemes for clustering problems. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 50-58.
9. DEERWESTER, S. C., DUMAIS, S. T., LANDAUER, T. K., FURNAS, G. W., AND HARSHMAN, R. A. 1990. Indexing by latent semantic analysis. JASIS 41, 6, 391-407.
10. DUDA, R. O., HART, P. E., AND STORK, D. G. 2000. Pattern Classification (2nd Edition), 2 ed. Wiley- Interscience, New York.
11. FALOUTSOS, C., BARBER, R., FLICKNER, M., HAFNER, J., NIBLACK, W., PETKOVIC, D., AND EQUITZ, W. 1994. Efficient and effective querying by image content. J. Intell. Inf. Syst. 3, 3/4, 231-262.
12. GURUSWAMI, V., AND INDYK, P. 2003. Embeddings and non-approximability of geometric problems. In Proceedings of the Symposium on Discrete Algorithms, ACM, New York, 537-538.
13. HAR-PELED, S., AND MAZUMDAR, S. 2004. On coresets for k-means and k-median clustering. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 291-300.
14. INABA,M., KATOH, N., AND IMAI, H. 1994. Applications of weighted voronoi diagrams and randomization to variance-based -clustering (extended abstract). In Proceedings of the Symposium on Computational Geometry. 332-339.
15. INDYK, P. 2004. High dimensional computational geometry. Ph.D. dissertation, Stanford Univ., Symposium, CA.
16. KOLLIOPOULOS, S. G., AND RAO, S. 2007. A nearly linear-time approximation scheme for the euclidean k-median problem. SIAM J. Comput. 37, 3, 757-782.
17. MATOUSEK, J. 2000. On approximate geometric k-clustering. Disc. Computat. Geom. 24, 1, 61-84.
18. OSTROVSKY, R., RABANI, Y., SCHULMAN, L. J., AND SWAMY, C. 2006. The effectiveness of lloyd-type methods for the k-means problem. In Proceedings of the Symposium on Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, CA, 165-176.
19. SABHARWAL, Y. AND SEN, S. 2005. Alinear time algorithm for approximate 2-means clustering. Comput. Geom. 32, 2, 159-172.
20. SWAIN, M. J., AND BALLARD, D. H. 1991. Color indexing. Intr. J. Comput. Vis. 7, 1, 11-32.