Clustering by Passing Messages Between Data Points
Brendan J. Frey, Delbert Dueck · Science · 2007
Clustering data by identifying a subset of representative examples is important for processing sensory signals and detecting patterns in data. Such "exemplars" can be found by randomly choosing an initial subset of data points and then iteratively refining it, but this works well only if that initial choice is close to a good solution. We devised a method called "affinity propagation," which takes as input measures of similarity between pairs of data points. Real-valued messages are exchanged between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. We used affinity propagation to cluster images of faces, detect genes in microarray data, identify representative sentences in this manuscript, and identify cities that are efficiently accessed by airline travel. Affinity propagation found clusters with much lower error than other methods, and it did so in less than one-hundredth the amount of time.
Cited by 6,758 works. doi:10.1126/science.1136800
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Elements of Information Theory
- Neural networks and physical systems with emergent collective computational abilities.
- Some methods for classification and analysis of multivariate observations
- Normalized cuts and image segmentation
- Foundations of statistical natural language processing
- Factor graphs and the sum-product algorithm
- Good error-correcting codes based on very sparse matrices
- Near optimum error correcting coding and decoding: turbo-codes
- Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms