Finding metric structure in information theoretic clustering

21st Annual Conference on Learning Theory, COLT 2008

Volumn , Issue , 2008, Pages 391-402

  Chaudhuri, Kamalika ^a   McGregor, Andrew ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE PROBABILITY DISTRIBUTION; INPUT DISTRIBUTIONS; K DISTRIBUTION; KL-DIVERGENCE; KULLBACK-LEIBLER DIVERGENCE; METRIC PROPERTIES; POLYNOMIAL-TIME ALGORITHMS; WORST-CASE PERFORMANCE;

PROBABILITY DISTRIBUTIONS;

CLUSTERING ALGORITHMS;

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

References (28)

1. M. R. Ackerman, J. Blomer, and C. Sohler. Clustering for metric and non-metric distance measures. In ACM-SIAM Symposium on Discrete Algorithms, 2008.
2. V. Arya, N. Garg, R. Khandekar, K. Munagala, and V. Pandit. Local search heuristic for k-median and facility location problems. In ACM Symposium on Theory of Computing, pages 21-29, 2001.
3. M. Badoiu, S. Har-Peled, and P. Indyk. Approximate clustering via core-sets. In ACM Symposium on Theory of Computing, pages 250-257, 2002.
4. L. D. Baker and A. K. McCallum. Distributional clustering of words for text classification. In W. B. Croft, A. Moffat, C. J. van Rijsbergen, R. Wilkinson, and J. Zobel, editors, 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.
5. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh. Clustering with bregman divergences. Journal of Machine Learning Research, 6: 1705-1749, 2005.
6. K. Chen. On k-median clustering in high dimensions. In Symposium on Discrete Algorithms, 2006.
7. * n-hard to approximate. J. ACM, 52(4): 538-551, 2005.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley Series in Telecommunications. John Wiley & Sons, New York, NY, USA, 1991.
9. K. Crammer, M. Kearns, and J. Wortman. Learning from multiple sources. In NIPS, pages 321-328, 2006.
10. I. Csiszár. Why least squares and maximum entropy? an axiomatic approach to inference for linear inverse problems. Ann. Statist., 19: 2032-2056, 1991.
11. I. S. Dhillon, S. Mallela, and R. Kumar. A divisive information-theoretic feature clustering algorithm for text classification. JMLR, 3: 1265-1287, 2003.
12. D. M. Endres and J. E. Schindelin. A new metric for probability distributions. IEEE Transactions on Information Theory, 49(7): 1858-1860, 2003.
13. T. Feder and D. Greene. Optimal algorithms for approximate clustering. In ACM Symposium on Theory of Computing, 1988.
14. U. Feige. A threshold of ln for approximating set cover. J. ACM, 45(4): 634-652, 1998.
15. D. Feldman, M. Monemizadeh, and C. Sohler. A ptas for k-means clustering based on weak coresets. In Symposium on Computational Geometry, pages 11-18, 2007.
16. T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci., 38: 293-306, 1985.
17. S. Guha, P. Indyk, and A. McGregor. Sketching information divergences. Submitted to Journal of Machine Learning, 2007.
18. S. Guha, A. McGregor, and S. Venkatasubramanian. Streaming and sublinear approximation of entropy and information distances. In ACM-SIAM Symposium on Discrete Algorithms, pages 733-742, 2006.
19. S. Har-Peled and S. Mazumdar. Coresets for k-means and k-median clustering and their applications. In ACM Symposium on Theory of Computing, 2004.
20. T. Kanungo, D. M. Mount, N. S. Netanyahu, C. D. Piatko, R. Silverman, and A. Y. Wu. A local search approximation algorithm for k-means clustering. Comput. Geom., 28(2-3): 89-112, 2004.
21. S. G. Kolliopoulos and S. Rao. A nearly linear-time approximation scheme for the euclidean kappa-median problem. In European Symposium on Algorithms, pages 378-389, 1999.
22. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1 + e)-approximation algorithm for k-means clustering in any dimensions. In IEEE Symposium on Foundations of Computer Science, pages 454-462. IEEE Computer Society, 2004.
23. * n) approximation algorithm for the asymmetric p-center problem. J. Algorithms, 27(2): 259-268, 1998.
24. F. C. N. Pereira, N. Tishby, and L. Lee. Distributional clustering of english words. In ACL, pages 183-190, 1993.
25. N. Slonim, R. Somerville, N. Tishby, and O. Lahav. Objective classification of galaxy spectra using the information bottleneck method. Monthly Notes of the Royal Astronomical Society, 323: 270-284, 2001.
26. N. Slonim and N. Tishby. Agglomerative information bottleneck. In NIPS, pages 617-623, 1999.
27. N. Tishby, F. Pereira, and W. Bialek. The information bottleneck method. In Proceedings of the 37-th Annual Allerton Conference on Communication, Control and Computing, pages 368-377, 1999.
28. F. Topsøe. Some inequalities for information divergence and related measures of discrimination. IEEE Transactions on Information Theory, 46(4): 1602-1609, 2000.