Hierarchical Clustering Based on Mutual Information

Simple item page
dc.creatorKraskov, Alexander
dc.creatorStögbauer, Harald
dc.creatorAndrzejak, Ralph G.
dc.creatorGrassberger, Peter
dc.date2003-11-28
dc.date2003-12-01
dc.date.accessioned2026-07-07T05:58:01Z
dc.date.available2026-07-07T05:58:01Z
dc.descriptionMotivation: Clustering is a frequently used concept in variety of bioinformatical applications. We present a new 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). Results: We use this both in the Shannon (probabilistic) version of information theory, where the "objects" are probability distributions represented by random samples, and in the Kolmogorov (algorithmic) version, where the "objects" are symbol sequences. We apply our method to the construction of mammal phylogenetic trees from mitochondrial DNA sequences and we reconstruct the fetal ECG from the output of independent components analysis (ICA) applied to the ECG of a pregnant woman. Availability: The programs for estimation of MI and for clustering (probabilistic version) are available at http://www.fz-juelich.de/nic/cs/software
dc.description11 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/q-bio/0311039
dc.identifierhttp://arxiv.org/abs/q-bio/0311039
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/88205
dc.subjectQuantitative Methods
dc.subjectComputational Complexity
dc.subjectBiological Physics
dc.titleHierarchical Clustering Based on Mutual Information
dc.typetext

Files

Collections

arXiv