The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Information-theoretic co-clustering
Abstract
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingency table analysis is co-clustering: simultaneous clustering of the rows and columns. A novel theoretical formulation views the contingency table as an empirical joint probability distribution of two discrete random variables and poses the co-clustering problem as an optimization problem in information theory---the optimal co-clustering maximizes the mutual information between the clustered random variables subject to constraints on the number of row and column clusters. We present an innovative co-clustering algorithm that monotonically increases the preserved mutual information by intertwining both the row and column clusterings at all stages. Using the practical example of simultaneous word-document clustering, we demonstrate that our algorithm works well in practice, especially in the presence of sparsity and high-dimensionality.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
On the Interpretation of χ 2 from Contingency Tables, and the Calculation of P
Fisher, R. A. (1922) · Journal of the Royal Statistical Society · doi:10.2307/2340521 · Cited by 2,953
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 3×
“Our information-theoretic formulation of preserving mutual information is similar to the information bottleneck (IB) framework [20], which was introduced for one-sided clustering, say X to X̂.”
BackgroundMethodBiclustering of expression data.
Cheng, Y., & Church, G. M. (2000) · PubMed · Cited by 2,098
NewsWeeder: Learning to Filter Netnews
Lang, K. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50048-7 · Cited by 2,051
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
Self-citationConcept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
Self-citationProceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2017)
Amendola, G., Ricca, F., & Truszczyński, M. (2017) · International Joint Conference on Artificial Intelligence · Cited by 1,179
Direct Clustering of a Data Matrix
Hartigan, J. A. (1972) · Journal of the American Statistical Association · doi:10.1080/01621459.1972.10481214 · Cited by 1,165
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
Mathematical Classification and Clustering
Mirkin, B. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600836 · Cited by 563
A divisive information theoretic feature clustering algorithm for text classification
Dhillon, I. S., Mallela, S., & Kumar, R. (2003) · doi:10.5555/944919.944973 · Cited by 500
Self-citationDocument clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
Mathematical Classification and Clustering
Mirkin, B. (1996) · Nonconvex Optimization and Its Applications · doi:10.1007/978-1-4613-0457-9 · Cited by 464
Latent Class Models for Collaborative Filtering
Hofmann, T., & Puzicha, J. (1999) · Cited by 428
Multivariate Information BottleneckPreprint
Friedman, N., Mosenzon, O., Slonim, N., & Tishby, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.2270 · Cited by 114
Iterative Double Clustering for Unsupervised and Semi-supervised Learning
El‐Yaniv, R., & Souroujon, O. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44795-4_11 · Cited by 68
Agglomerative Multivariate Information Bottleneck
Slonim, N., Friedman, N., & Tishby, N. (2001) · Cited by 39
Cited by
A Comprehensive Survey on Transfer Learning
Zhuang, F., Qi, Z., Duan, K., Xi, D., Zhu, Y., Zhu, H., Xiong, H., & He, Q. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3004555 · Cited by 6,678
“For example, some transfer learning approaches implicitly reduce the features by using the co-clustering technique, that is, simultaneously clustering both the columns and rows of (or say, co-cluster) a contingency table based on the information theory [85].”
MethodBiclustering algorithms for biological data analysis: a survey
Madeira, S. C., & Oliveira, A. L. (2004) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2004.2 · Cited by 2,049
PathSim: meta path-based top-K similarity search in heterogeneous information networks
Sun, Y., Han, J., Yan, X., Yu, P. S., & Wu, T. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402736 · Cited by 1,870
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
“…2004],[Newman, 2006]; co-clustering for concurrent clustering of the rows and the columns of the adjacency matrix of a graph [Chakrabarti, 2004, Dhillon et al., 2003], and its distributed variants [Papadimitriou and Sun, 2008]; dynamic community detection algorithms Tantipathananandh and…”
BackgroundFast Random Walk with Restart and Its Applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.70 · Cited by 1,184
Metadata
- Authors
- Dhillon, I. S., Mallela, S., & Modha, D. S.
- Venue
- Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2003-08-24
- Pages
- 89-98
- OpenAlex
- W2434205482
- Cited by
- 1,006
- References
- 22
- FWCI
- 24.79
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.