Issue No. 01 - January (2008 vol. 30)
Hierarchical clustering is a stepwise clustering method usually based on proximity measures between objects or sets of objects from a given data set. The most common proximity measures are distance measures. The derived proximity matrices can be used to build graphs, which provide the basic structure for some clustering methods. We present here a new proximity matrix based on an entropic measure and also a clustering algorithm (LEGClust) that builds layers of subgraphs based on this matrix, and uses them and a hierarchical agglomerative clustering technique to form the clusters. Our approach capitalizes on both a graph structure and a hierarchical construction. Moreover, by using entropy as a proximity measure we are able, with no assumption about the cluster shapes, to capture the local structure of the data, forcing the clustering method to reflect this structure. We present several experiments on artificial and real data sets that provide evidence on the superior performance of this new algorithm when compared with competing ones.
Clustering, Entropy, Graphs
L. A. Alexandre, J. M. Santos and J. Marques de Sa, "LEGClust—A Clustering Algorithm Based on Layered Entropic Subgraphs," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 30, no. , pp. 62-75, 2007.