Entropy 2011, 13(2), 450-465; doi:10.3390/e13020450
Article

Information Theoretic Hierarchical Clustering

1 Control and Intelligent Processing Center of Excellence, School of Electrical and Computer Engineering, University of Tehran, PO Box 1439957131, Tehran 14395-515, Iran 2 Department of Electrical and Computer Engineering, Michigan State University, East Lansing, MI 48824, USA 3 Radiology Image Analysis Laboratory, Henry Ford Health System, Detroit, MI 48202, USA 4 School of Cognitive Sciences, Institute for Research in Fundamental Sciences (IPM), PO Box 1954856316, Tehran, Iran
* Author to whom correspondence should be addressed.
Received: 8 December 2010; in revised form: 31 December 2010 / Accepted: 27 January 2011 / Published: 10 February 2011
(This article belongs to the Special Issue Advances in Information Theory)
PDF Full-text Download PDF Full-Text [298 KB, uploaded 10 February 2011 11:01 CET]
Abstract: Hierarchical clustering has been extensively used in practice, where clusters can be assigned and analyzed simultaneously, especially when estimating the number of clusters is challenging. However, due to the conventional proximity measures recruited in these algorithms, they are only capable of detecting mass-shape clusters and encounter problems in identifying complex data structures. Here, we introduce two bottom-up hierarchical approaches that exploit an information theoretic proximity measure to explore the nonlinear boundaries between clusters and extract data structures further than the second order statistics. Experimental results on both artificial and real datasets demonstrate the superiority of the proposed algorithm compared to conventional and information theoretic clustering algorithms reported in the literature, especially in detecting the true number of clusters.
Keywords: information theory; Rényi’s entropy; quadratic mutual information; hierarchical clustering; proximity measure

Article Statistics

Load and display the download statistics.

Citations to this Article

Cite This Article

MDPI and ACS Style

Aghagolzadeh, M.; Soltanian-Zadeh, H.; Araabi, B.N. Information Theoretic Hierarchical Clustering. Entropy 2011, 13, 450-465.

AMA Style

Aghagolzadeh M, Soltanian-Zadeh H, Araabi BN. Information Theoretic Hierarchical Clustering. Entropy. 2011; 13(2):450-465.

Chicago/Turabian Style

Aghagolzadeh, Mehdi; Soltanian-Zadeh, Hamid; Araabi, Babak Nadjar. 2011. "Information Theoretic Hierarchical Clustering." Entropy 13, no. 2: 450-465.

Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert