Elucidating the solution structure of the K-means cost function using energy landscape theory
Open Access
- 2 February 2022
- journal article
- conference paper
- Published by AIP Publishing in The Journal of Chemical Physics
- Vol. 156 (5) , 054109
Abstract
The K-means algorithm, routinely used in many scientific fields, generates clustering solutions that depend on the initial cluster coordinates. The number of solutions may be large, which can make locating the global minimum challenging. Hence, the topography of the cost function surface is crucial to understanding the performance of the algorithm. Here, we employ the energy landscape approach to elucidate the topography of the K-means cost function surface for Fisher’s Iris dataset. For any number of clusters, we find that the solution landscapes have a funneled structure that is usually associated with efficient global optimization. An analysis of the barriers between clustering solutions shows that the funneled structures result from remarkably small barriers between almost all clustering solutions. The funneled structure becomes less well-defined as the number of clusters increases, and we analyze kinetic analogs to quantify the increased difficulty in locating the global minimum for these different landscapes.Keywords
Funding Information
- Engineering and Physical Sciences Research Council (EP/L015552/1)
- Agence Nationale de la Recherche (ANR-19-P3IA-0002)
This publication has 69 references indexed in Scilit:
- Finding reproducible cluster partitions for the k-means algorithmBMC Bioinformatics, 2013
- How the initialization affects the stability of the қ-means algorithmESAIM: Probability and Statistics, 2012
- Exploring the Free Energy Landscape: From Dynamics to Networks and BackPLOS Computational Biology, 2009
- Optimizing Conical Intersections without Derivative Coupling Vectors: Application to Multistate Multireference Second-Order Perturbation Theory (MS-CASPT2)The Journal of Physical Chemistry B, 2007
- Protein folding and misfoldingNature, 2003
- A near-optimal initial seed value selection in K-means means algorithm using a genetic algorithmPattern Recognition Letters, 1993
- A simulated annealing algorithm for the clustering problemPattern Recognition, 1991
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- A Correlation of Reaction RatesJournal of the American Chemical Society, 1955