Clustering by fast search and find of density peaks
Top Cited Papers
- 27 June 2014
- journal article
- other
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 344 (6191), 1492-1496
- https://doi.org/10.1126/science.1242072
Abstract
Discerning clusters of data points: Cluster analysis is used in many disciplines to group objects according to a defined measure of distance. Numerous algorithms exist, some based on the analysis of the local density of data points, and others on predefined probability distributions. Rodriguez and Laio devised a method in which the cluster centers are recognized as local density maxima that are far away from any points of higher density. The algorithm depends only on the relative densities rather than their absolute values. The authors tested the method on a series of data sets, and its performance compared favorably to that of established techniques. Science , this issue p. 1492Keywords
This publication has 16 references indexed in Scilit:
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2009
- A Kinetic Model of Trp-Cage Folding from Multiple Biased Molecular Dynamics SimulationsPLoS Computational Biology, 2009
- Robust path-based spectral clusteringPattern Recognition, 2008
- Clustering aggregationACM Transactions on Knowledge Discovery From Data, 2007
- Clustering by Passing Messages Between Data PointsScience, 2007
- Iterative shrinking method for clustering problemsPattern Recognition, 2006
- Survey of Clustering AlgorithmsIEEE Transactions on Neural Networks, 2005
- Mean shift, mode seeking, and clusteringIEEE Transactions on Pattern Analysis and Machine Intelligence, 1995
- The estimation of the gradient of a density function, with applications in pattern recognitionIEEE Transactions on Information Theory, 1975
- Hierarchical Grouping to Optimize an Objective FunctionJournal of the American Statistical Association, 1963