Publication Date:
2008-02-09
Description:
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.〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Brusco, Michael J -- Kohn, Hans-Friedrich -- New York, N.Y. -- Science. 2008 Feb 8;319(5864):726; author reply 726. doi: 10.1126/science.1150938.〈br /〉〈span class="detail_caption"〉Author address: 〈/span〉College of Business, 307 Rovetta Business Building, Florida State University, Tallahassee, FL 32306-1110, USA. mbrusco@cob.fsu.edu〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/18258881" target="_blank"〉PubMed〈/a〉
Keywords:
*Algorithms
;
*Cluster Analysis
;
Data Interpretation, Statistical
Print ISSN:
0036-8075
Electronic ISSN:
1095-9203
Topics:
Biology
,
Chemistry and Pharmacology
,
Computer Science
,
Medicine
,
Natural Sciences in General
,
Physics
Permalink
