Clustering for metric and non-metric distance measures

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 799-808

  Ackermann, Marcel R ^a   Blömer, Johannes ^a   Sohler, Christian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY;

BREG MAN DIVERGENCES; DISSIMILARITY MEASURES; DISTANCE MEASURES; EUCLIDEAN; K MEANS; K MEDIAN PROBLEM; KULLBACK LEIBLER DIVERGENCE (KLD); MAHALANOBIS DISTANCE (MD); MEDIAN PROBLEM; RANDOM SAMPLES; RELATIVE ENTROPY (RE);

APPROXIMATION ALGORITHMS;

EID: 56049103584     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Mihai Badoiu, Sariel Har-Peled, and Piotr Indyk. Approximate clustering via core-sets. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC '02), pages 250-257, 2002.
2. Chandrajit L. Bajaj. The algebraic degree of geometric optimization problems. Discrete and Computational Geometry, 3(1):177-191, December 1988.
3. L. Douglas Baker and Andrew K. McCallum. Distributional clustering of words for text classification. In Proceedings of SIGIR-98, 21st ACM International Conference on Research and Development in Information Retrieval, pages 96-103, Melbourne, AU, 1998. ACM Press, New York, US.
4. Arindam Banerjee, Srujana Merugu, Inderjit S. Dhillon, and Joydeep Ghosh. Clustering with bregman divergences. Journal of Machine Learning Research (JMLR), 6:1705-1749, October 2005.
5. Lev M. Bregman. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7:200-217, 1967.
6. Yair Censor and Stavros A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1997.
7. Ke Chen. On k-median clustering in high dimensions. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '06), pages 1177-1185, 2006.
8. Thomas M. Cover and Joy A. Thomas. Elements of Information Theory. Wiley-Interscience, 2nd edition, 2006.
9. Inderjit S. Dhillon, Subramanyam Mallela, and Rahul Kumar. A divisive information-theoretic feature clustering algorithm for text, classifcation. Journal of Machine Learning Research (JMLR), 3:1265-1287, March 2003.
10. Dan Feldman, Morteza Monemizadeh, and Christian Sohler. A ptas for k-means clustering based on weak coresets. In Proceedings of the 23rd ACM Symposium on Computational Geometry (SCG'07), pages 11-18, 2007.
11. Wenceslas Fernandez de la Vega, Marek Karpinski, Claire Kenyon, and Yuval Rabani. Approximation schemes for clustering problems. In Proceedings of the 35th Annual ACM Symposium on 'Theory of Computing (STOC '03), pages 50-58, 2003.
12. Anupam Gupta, Robert Krauthgamer, and James R. Lee. Bounded geometries, fractals and low-distortion embeddings. In Proceedings of the. 44th Symposium on Foundations of Computer Science (FOCS'03), pages 534-543, 2003.
13. Sariel Har-Peled and Soham Mazumdar. On coresets for k-means and k-median clustering. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC '04), pages 291-300, 2004.
14. Mary Inaba, Naoki Katoh, and Hiroshi Imai. Applications of weighted voronoi diagrams and randomization to variance-based k-clustering. In Proceedings of the 10th annual Symposium on Computational Geometry (SCG '94), pages 332-339, New York, NY, USA, 1994. ACM Press.
15. Piotr Indyk and Mikkel Thorup. Approximate 1- medians. Manuscript, 2000.
16. Anil K. Jain, M. Narasimha Murty, and Patrick J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, 1999.
17. Kamal Jain, Mohammad Mahdian, Evangelos Markakis, Amin Saberi, and Vijay V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. Journal of the ACM (JACM), 50(6):795-824, 2003.
18. Stavros G. Kolliopoulos and Satish Rao. A nearly linear-time approximation scheme for the euclidean κ- median problem. In Proceedings of the 7th annual European Symposium on Algorithms (ESA '99), pages 378-389, 1999.
19. Solomon Kullback and Richard A. Leibler. On information and sufficiency. Annals of Mathematical Statistics, 22:79-86, 1951.
20. Amit Kumar, Yogish Sabharwal, and Sandeep Sen. A simple linear time (1+∈)-approximation algorithm for k-means clustering in any dimensions. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04), pages 454-462, Washington, DC, USA, 2004. IEEE Computer Society.
21. Amit Kumar, Yogish Sabharwal, and Sandeep Sen. Linear time for clustering problems in any dimensions. In Proceedings of the 32nd International Colloquium on Automata, Languages and Programming (ICALP'05), pages 1374-1385, Berlin, 2005. Springer Verlag.
22. Stuart P. Lloyd. Least squares quantization in pcm. IEEE Transactions on Information Theory, 28(2):129-137, 1982.
23. Prasanta Chandra Mahalanobis. On the generalized distance in statistics. In Proceedings of the National Institute of Sciences of India, volume 2, pages 49-55, 1936.
24. Jin Matousek. On approximate geometric k-clustering. Discrete & Computational Geometry, 24(1):61-84, 2000.
25. Vaniel P. Mercer. Clustering large datasets. Technical report, Linacre College, 2003.
26. Ramgopal R. Mettu and C. Greg Plaxton. Optimal time bounds for approximate clustering. Machine Learning, 56(1-3):35-60, 2004.
27. Fernando C. Pereira, Naftali Tishby, and Lillian Lee. Distributional clustering of english words. In Meeting of the Association for Computational Linguistics, pages 183-190, 1993.
28. Noam Slonim and Naftali Tishby. Agglomerative information bottleneck. In Advances in Neural Information Processing Systems 12 (NIPS 12), pages 617-623, 1999.
29. Mikkel Thorup. Quick k-median, k-center, and facility location for sparse graphs. SIAM Journal on Computation, pages 405-432, 2004.
30. Rui Xu and Donald Wunsch II. Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16:645-678, May 2005.