Clustering Data by Melting
- 1 January 1993
- journal article
- Published by MIT Press in Neural Computation
- Vol. 5 (1) , 89-104
- https://doi.org/10.1162/neco.1993.5.1.89
Abstract
We derive a new clustering algorithm based on information theory and statistical mechanics, which is the only algorithm that incorporates scale. It also introduces a new concept into clustering: cluster independence. The cluster centers correspond to the local minima of a thermodynamic free energy, which are identified as the fixed points of a one-parameter nonlinear map. The algorithm works by melting the system to produce a tree of clusters in the scale space. Melting is also insensitive to variability in cluster densities, cluster sizes, and ellipsoidal shapes and orientations. We tested the algorithm successfully on both simulated data and a Synthetic Aperture Radar image of an agricultural site with 12 attributes for crop identification.Keywords
This publication has 9 references indexed in Scilit:
- A new approach to clusteringPublished by Elsevier ,2004
- A deterministic annealing approach to clusteringPattern Recognition Letters, 1990
- Unsupervised optimal fuzzy clusteringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The structure of imagesBiological Cybernetics, 1984
- Optimization by Simulated AnnealingScience, 1983
- An Algorithm for Vector Quantizer DesignIEEE Transactions on Communications, 1980
- PATTERN CLUSTERING BY MULTIVARIATE MIXTURE ANALYSISMultivariate Behavioral Research, 1970
- A clustering technique for summarizing multivariate dataBehavioral Science, 1967
- Information Theory and Statistical MechanicsPhysical Review B, 1957