Volume 70, Number 2, April 2005
|Page(s)||278 - 284|
|Section||Interdisciplinary physics and related areas of science and technology|
|Published online||25 March 2005|
Hierarchical clustering using mutual information
John-von-Neumann Institute for Computing, Forschungszentrum Jülich D-52425 Jülich, Germany
2 Division of Biology, MC 139-74, California Institute of Technology Pasadena, CA 91125, USA
Accepted: 1 March 2005
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 . 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.
PACS: 89.70.+c – Information theory and communication theory / 89.75.Hc – Networks and genealogical trees / 87.19.Hh – Cardiac dynamics
© EDP Sciences, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.