Information-theoretic co-clustering

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2003, Pages 89-98

  Dhillon, Inderjit S ^a   Mallela, Subramanyam ^a   Modha, Dharmendra S ^b  

^a University of Texas ^*  (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Co clustering; Information theory; Mutual information

Indexed keywords

CLUSTERINGS; CO-CLUSTERING; CO-OCCURRENCE; COLUMN CLUSTERS; CONTINGENCY TABLE; CONTINGENCY TABLE ANALYSIS; DATA ANALYSIS; DISCRETE RANDOM VARIABLES; DOCUMENT CLUSTERING; JOINT PROBABILITY; MUTUAL INFORMATIONS; OPTIMIZATION PROBLEMS; THEORETICAL FORMULATION;

CLUSTERING ALGORITHMS; COBALT COMPOUNDS; DATA MINING; INFORMATION THEORY; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM VARIABLES; SECURITY OF DATA; STATISTICS;

CLUSTER ANALYSIS;

EID: 77952375075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/956750.956764     Document Type: Conference Paper

References (20)

1. P. Bradley, U. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In KDD'03. AAAI Press, 1998.
2. Y. Cheng and G. Church. Biclustering of expression data. In Proceedings ISMB, pages 93-103. AAAI Press, 2000.
3. T. Cover and J. Thomas. Elements of Information Theory. John Wiley & Sons, New York, USA, 1991.
4. I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In Proceedings of The 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2001), pages 269-274, 2001.
5. I. S. Dhillon, J. Fan, and Y. Guan. Efficient clustering of very large document collections. In R. Grossman, C. Kamath, P. Kegelmeyer, V. Kumar, and R. Namburu, editors, Data Mining for Scientific and Engineering Applications, pages 357-381. Kluwer Academic Publishers, 2001.
6. I. S. Dhillon, S. Mallela, and R. Kumar. A divisive information-theoretic feature clustering algorithm for text classification. Journal of Machine Learning Research (JMLR): Special Issue on Variable and Feature Selection, 3:1265-1287, March 2003.
7. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42 (1):143-175, January 2001.
8. R. El-Yaniv and O. Souroujon. Iterative double clustering for unsupervised and semi-supervised learning. In ECML-01, pages 121-132, 2001.
9. 2 from the contingency tables, and the calculation of p. J. Royal Stat. Soc., 85:87-94, 1922.
10. N. Friedman, O. Mosenzon, N. Slonim, and N. Tishby. Multivariate information bottleneck. In UAI-2001, pages 152-161, 2001.
11. J. A. Hartigan. Direct clustering of a data matrix. Journal of the American Statistical Association, 67 (337):123-129, March 1972.
12. T. Hofmann. Probabilistic latent semantic indexing. In Proc. ACM SIGIR. ACM Press, August 1999.
13. T. Hofmann and J. Puzicha. Latent class models for collaborative filtering. In Proceedings of the International Joint Conference in Artificial Intelligence (IJCAI), 1999.
14. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice-Hall, Englewood Cliffs, NJ, 1988.
15. Ken Lang. News Weeder: Learning to filter netnews. In ICML-95, pages 331-339, 1995.
16. A. K. McCallum. Bow: A toolkit for statistical language modeling, text retrieval, classification and clustering. www.cs.cmu.edu/mccallum/bow, 1996.
17. B. Mirkin. Mathematical Classification and Clustering. Kluwer Academic Publishers, 1996.
18. N. Slonim, N. Friedman, and N. Tishby. Agglomerative multivariate information bottleneck. In NIPS-14, 2001.
19. N. Slonim and N. Tishby. Document clustering using word clusters via the information bottleneck method. In ACM SIGIR, pages 208-215, 2000.
20. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. In Proc. of the 37-th Annual Allerton Conference on Communication, Control and Computing, pages 368-377, 1999.