Coresets and approximate clustering for Bregman divergences

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2009, Pages 1088-1097

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

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); INFORMATION THEORY; SPEECH PROCESSING; TEXT PROCESSING;

BREGMAN DIVERGENCES; DISSIMILARITY MEASURES; FINITE SET; ITAKURA-SAITO DIVERGENCES; K-MEDIAN PROBLEM; KULLBACK LEIBLER DIVERGENCE; RUNNING TIME; TEXT CLASSIFICATION;

APPROXIMATION ALGORITHMS;

EID: 70349085755     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973068.118     Document Type: Conference Paper

References (23)

1. Marcel R. Ackermann, Johannes Blömer, and Christian Sohler. Clustering for metric and non-metric distance measures. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08), pages 799-808. Society for Industrial and Applied Mathematics, 2008.
2. David Arthur and Sergei Vassilvitskii. k-means++: the advantages of careful seeding. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '07), pages 1027-1035, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
3. 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.
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. Andrés Buzo, Augustine H. Gray, Jr., Robert M. Gray, and John D. Markel. Speech coding based upon vector quantization. IEEE Transactions on Acoustics, Speech, and Signal Processing, 28(5):562-574, Oct 1980.
7. Yair Censor and Stavros A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1997.
8. 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.
9. Ke Chen. On k-median and k-means clustering in metric and Euclidean spaces and their applications. Manuscript, available at: http://ews.uiuc.edu/ ~kechen/, July 2007.
10. Artur Czumaj and Christian Sohler. Sublinear-time approximation for clustering via random sampling. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04), pages 396-407, 2004.
11. 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.
12. 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. (Pubitemid 47582035)
13. Gereon Frahling and Christian Sohler. Coresets in dynamic geometric data streams. In Proceedings of the 27th Annual A CM Symposium on Theory of Computing (STOC'05), pages 209-217, New York, NY, USA, 2005. ACM.
14. Sariel Har-Peled and Akash Kushal. Smaller coresets for k-median and k-means clustering. In Proceedings of the 21st Annual Symposium on Computational Geometry (SCG'05), pages 126-134, New York, NY, USA, 2005. ACM.
15. Sariel Har-Peled and Soham Mazumdar. On coresets for ifc-means and fc-median clustering. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC '04), pages 291-300, 2004.
16. David Haussler. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100(1):78-150, 1992.
17. Anil K. Jain, M. Narasimha Murty, and Patrick J. Flynn. Data clustering: A review. ACM Computing Surveys, 31(3):264-323, 1999.
18. 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.
19. Stuart P. Lloyd. Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2):129-137, 1982.
20. 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.
21. Nina Mishra, Dan Oblinger, and Leonard Pitt. Sublinear time approximate clustering. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'01), pages 439-447, 2001.
22. Frank Nielsen, Jean-Daniel Boissonnat, and Richard Nock. On Bregman Voronoi diagrams. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'07), pages 746-755, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics.
23. Rui Xu and Donald Wunsch II. Survey of clustering algorithms. IEEE Transactions on Neural Networks, 16:645-678, May 2005.