Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Science 8 February 2008:
Vol. 319. no. 5864, p. 726
DOI: 10.1126/science.1150938
Prev | Table of Contents | Next

Technical Comments

Comment on "Clustering by Passing Messages Between Data Points"

Michael J. Brusco1* and Hans-Friedrich Köhn2

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.

1 College of Business, 307 Rovetta Business Building, Florida State University, Tallahassee, FL 32306–1110, USA.
2 Department of Psychological Sciences, 19 McAlester Hall, University of Missouri-Columbia, Columbia, MO 65211, USA.

* To whom correspondence should be addressed. E-mail: mbrusco{at}cob.fsu.edu

Read the Full Text

To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)