Issue Europhys. Lett. Volume 70, Number 2, April 2005 Page(s) 278 - 284 Section Interdisciplinary physics and related areas of science and technology DOI 10.1209/epl/i2004-10483-y Published online 25 March 2005

Europhys. Lett., 70 (2), pp. 278-284 (2005)
DOI: 10.1209/epl/i2004-10483-y

Hierarchical clustering using mutual information

A. Kraskov^{1, 2}, H. Stögbauer¹, R. G. Andrzejak¹ and P. Grassberger<sup>1

1</sup>  John-von-Neumann Institute for Computing, Forschungszentrum Jülich D-52425 Jülich, Germany
²  Division of Biology, MC 139-74, California Institute of Technology Pasadena, CA 91125, USA

received 8 June 2004; accepted in final form 1 March 2005
published online 25 March 2005

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.

PACS
89.70.+c - Information theory and communication theory.
89.75.Hc - Networks and genealogical trees.
87.19.Hh - Cardiac dynamics.

© EDP Sciences 2005

What is OpenURL?