Linear time algorithms for clustering problems in any dimensions

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 1374-1385

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

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; LINEAR EQUATIONS; PROBLEM SOLVING;

CLUSTERING; K-MEANS ALGORITHM; LINEAR TIME ALGORITHM;

ALGORITHMS;

EID: 26444519161     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_111     Document Type: Conference Paper

References (16)

1. Arora, S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 37th Annual Symposium on Foundations of Computer Science (1996) 2-11
2. Arora, S., Raghavan, P., Rao, S.: Approximation schemes for Euclidean k-medians and related problems. Proceedings of the thirtieth annual ACM symposium on Theory of computing (1998) 106-113
3. Badoiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (2002) 250-257
4. Bern, M., Eppstein, D.: Approximation algorithms for geometric problems. Approximating algorithms for NP-Hard problems. PWS Publishing Company (1997) 296-345
5. Broder, A., Glassman, S., Manasse, M., Zweig, G.: Syntactic clustering of the Web. Proc. of 6th International World Wide Web Conference (1997) 391-404
6. de la Vega, W. F., Karpinski, M., Kenyon, C., Rabani, Y.: Approximation schemes for clustering problems. Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (2003) 50-58
7. Deerwester, S., Dumais, S. T., Landauer, T. K., Furnas, G. W., Harshman, R. A.: Indexing by latent semantic analysis. Journal of the American Society for Information Science 41(6) (1990) 391-407
8. Duda, R. O., Hart, P. E., Stork, D. G.: Pattern Classification. Wiley-Interscience, New York, 2nd edition (2001)
9. Faloutsos, C., Barber, R., Flickner, M., Hafner, J., Niblack, W., Petkovic, D., Equitz, W.: Efficient and effective querying by image content. Journal of Intelligent Information Systems 3(3) (1994) 231-262
10. Har-Peled, S., Mazumdar, S.: On coresets for k-means and k-median clustering. Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004) 291-300
11. Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. Proceedings of the tenth annual symposium on Computational Geometry (1994) 332-339
12. Indyk, P.: High Dimensional Computational Geometry. Ph.D. Thesis. Department of Computer Science, Stanford University (2004)
13. Kolliopoulos, S., Rao, S.: A nearly linear time approximation scheme for the Euclidean k-medians problem. Proceedings of the 7th European Symposium on Algorithms (1999) 362-371
14. Kumar, A., Sabharwal, Y., Sen, S.: A simple linear time (1 + ε)-approximation algorithm for k-means clustering in any dimensions. Proceedings of the 45th Annual Symposium on Foundations of Computer Science (2004) 454-462
15. Matousek, J.: On approximate geometric k-clustering Discrete and Computational Geometry 24 (2000) 61-84
16. Swain, M. J., Ballard, D. H.: Color indexing. International Journal of Computer Vision (1991) 11-32