Comment on "clustering by passing messages between data points"

Michael J. Brusco, Hans Friedrich Köhn

Research output: Contribution to journal › Comment/debate

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.

Original languageEnglish (US)
Pages (from-to)726c
JournalScience
Volume319
Issue number5864
DOIs
StatePublished - Feb 8 2008
Externally publishedYes

Fingerprint

Cluster Analysis
Heuristics

ASJC Scopus subject areas

  • General

Cite this

Comment on "clustering by passing messages between data points". / Brusco, Michael J.; Köhn, Hans Friedrich.

In: Science, Vol. 319, No. 5864, 08.02.2008, p. 726c.

Research output: Contribution to journal › Comment/debate

Brusco, MJ & Köhn, HF 2008, 'Comment on "clustering by passing messages between data points"', Science, vol. 319, no. 5864, pp. 726c. https://doi.org/10.1126/science.1150938
Brusco MJ, Köhn HF. Comment on "clustering by passing messages between data points". Science. 2008 Feb 8;319(5864):726c. https://doi.org/10.1126/science.1150938
Brusco, Michael J. ; Köhn, Hans Friedrich. / Comment on "clustering by passing messages between data points". In: Science. 2008 ; Vol. 319, No. 5864. pp. 726c.
@article{c06c06f94ed646999b5561e654327b94,
title = "Comment on {"}clustering by passing messages between data points{"}",
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.",
author = "Brusco, {Michael J.} and K{\"o}hn, {Hans Friedrich}",
year = "2008",
month = "2",
day = "8",
doi = "10.1126/science.1150938",
language = "English (US)",
volume = "319",
pages = "726c",
journal = "Science",
issn = "0036-8075",
publisher = "American Association for the Advancement of Science",
number = "5864",

}

TY - JOUR

T1 - Comment on "clustering by passing messages between data points"

AU - Brusco, Michael J.

AU - Köhn, Hans Friedrich

PY - 2008/2/8

Y1 - 2008/2/8

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38949090436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38949090436&partnerID=8YFLogxK

U2 - 10.1126/science.1150938

DO - 10.1126/science.1150938

M3 - Comment/debate

C2 - 18258881

AN - SCOPUS:38949090436

VL - 319

SP - 726c

JO - Science

JF - Science

SN - 0036-8075

IS - 5864

ER -

Access to Document