The DOI matches its Crossref record.
Hierarchical clustering using mutual information
Abstract
We present a conceptually simple method for hierarchical clustering of data called mutual information clustering (MIC) algorithm. It uses mutual information (MI) as a similarity measure and exploits its grouping property: The MI between three objects X , Y , and Z is equal to the sum of the MI between X and Y , plus the MI between Z and the combined object ( XY ). We use this both in the Shannon (probabilistic) version of information theory and in the Kolmogorov (algorithmic) version. We apply our method to the construction of phylogenetic trees from mitochondrial DNA sequences and to the output of independent components analysis (ICA) as illustrated with the ECG of a pregnant woman.
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
Cited by
Vinh, N. X., Epps, J., & Bailey, J. (2010) · Minerva Access (University of Melbourne) · doi:10.5555/1756006.1953024 · Cited by 1,781
A Survey of Clustering With Deep Learning: From the Perspective of Network Architecture
Min, E., Guo, X., Liu, Q., Zhang, G., Cui, J., & Long, J. (2018) · IEEE Access · doi:10.1109/access.2018.2855437 · Cited by 553
Comparison of co-expression measures: mutual information, correlation, and model based indices
Song, L., Langfelder, P., & Horvath, S. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-328 · Cited by 460
Correlation, hierarchies, and networks in financial markets
Tumminello, M., Lillo, F., & Mantegna, R. N. (2010) · Journal of Economic Behavior & Organization · doi:10.1016/j.jebo.2010.01.004 · Cited by 380
Metadata
- Authors
- Kraskov, A., Stögbauer, H., Andrzejak, R. G., & Grassberger, P.
- Venue
- Europhysics Letters (EPL)
- Publisher
- IOP Publishing
- Published
- 2005-04
- Volume
- 70
- Issue
- 2
- Pages
- 278-284
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W2026126704
- Cited by
- 236
- References
- 0
- FWCI
- 9.28
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hierarchical clustering using mutual information. https://app.cochat.ai/papers/10.1209/epl/i2004-10483-y
- The paper
- Kraskov, A., Stögbauer, H., Andrzejak, R. G., & Grassberger, P. (2005). Hierarchical clustering using mutual information. Europhysics Letters (EPL). https://doi.org/10.1209/epl/i2004-10483-y
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.