Hierarchical Clustering Using Mutual Information
Alexander Kraskov, Harald Stoegbauer, Ralph G. Andrzejak, Peter, Grassberger

TL;DR
This paper introduces a hierarchical clustering method called mutual information clustering (MIC) that uses mutual information as a similarity measure, leveraging its grouping property in both Shannon and Kolmogorov information theories, demonstrated on DNA and ECG data.
Contribution
The paper proposes a novel hierarchical clustering algorithm based on mutual information, applicable in both probabilistic and algorithmic information frameworks.
Findings
Successfully constructed phylogenetic trees from mitochondrial DNA sequences.
Effectively clustered ECG signals using ICA outputs.
Demonstrated the method's versatility across biological and signal processing data.
Abstract
We present a method for hierarchical clustering of data called {\it mutual information clustering} (MIC) algorithm. It uses mutual information (MI) as a similarity measure and exploits its grouping property: The MI between three objects and is equal to the sum of the MI between and , plus the MI between and the combined object . 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFractal and DNA sequence analysis · Blind Source Separation Techniques · Machine Learning in Bioinformatics
