A generalized maximum entropy approach to Bregman co-clustering and matrix approximation

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 509-514

  Banerjee, Arindam ^a   Dhillon, Inderjit ^a   Ghosh, Joydeep ^a   Merugu, Srujana ^a   Modha, Dharmendra S ^b  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Bregman divergences; Co clustering; Matrix Approximation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; ERROR ANALYSIS; INFORMATION ANALYSIS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; RANDOM PROCESSES;

BREG-MAN DIVERGENCES; CO-CLUSTERING; DATA MATRIX; MATRIX APPROXIMATION;

DATA MINING;

EID: 12244261221     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014111     Document Type: Conference Paper

References (11)

1. A. Banerjee, I. Dhillon, J. Ghosh, S. Merugu, and D. Modha. A generalized maximum entropy approach to bregman co-clustering and matrix approximation. Technical Report UTCS TR04-24, UT, Austin, 2004.
2. A. Banerjee, S. Merugu, I. Dhillon, and J. Ghosh. Clustering with Bregman divergences. In SDM, 2004.
3. Y. Censor and S. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford University Press, 1998.
4. Y. Cheng and G. M. Church. Biclustering of expression data. In ICMB, pages 93-103, 2000.
5. H. Cho, I. S. Dhillon, Y. Guan, and S. Sra. Minimum sum squared residue co-clustering of gene expression data. In SDM, 2004.
6. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley-Interscience, 1991.
7. I. Csiszar. Why least squares and maximum entropy? an axiomatic approach to inference for linear inverse problems. Annals of Statistics, 19:2032-2066, 1991.
8. I. Dhillon, S. Mallela, and D. Modha. Information-theoretic co-clustering. In KDD, pages 89-98, 2003.
9. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67(337):123-129, 1972.
10. T. Hofmann and J. Puzicha. Unsupervised learning from dyadic data. Technical Report TR-98-042, ICSI, Berkeley, 1998.
11. D. L. Lee and S. Seung. Algorithms for non-negative matrix factorization. In NIPS, 2001. 556-562.