Comment on "Clustering by Passing Messages Between Data Points"
Open Access
- 8 February 2008
- journal article
- editorial
- Published by American Association for the Advancement of Science (AAAS) in Science
- Vol. 319 (5864) , 726
Abstract
Frey and Dueck (Reports, 16 February 2007, p. 972) described an algorithm termed “affinity propagation” (AP) as a promising alternative to traditional data clustering procedures. We demonstrate that a well-established heuristic for the p -median problem often obtains clustering solutions with lower error than AP and produces these solutions in comparable computation time.Keywords
This publication has 10 references indexed in Scilit:
- The p-median problem: A survey of metaheuristic approachesEuropean Journal of Operational Research, 2007
- Clustering by Passing Messages Between Data PointsScience, 2007
- Variable neighborhood search for the p-medianLocation Science, 1997
- An efficient tabu search procedure for the p-Median ProblemEuropean Journal of Operational Research, 1997
- Solution of large-scale symmetric travelling salesman problemsMathematical Programming, 1991
- A comparison of two dual-based procedures for solving the p-median problemEuropean Journal of Operational Research, 1985
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate AlgorithmsManagement Science, 1977
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted GraphOperations Research, 1968
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936