MétaCan
← all works

Clustering by Passing Messages Between Data Points

2007· article· en· 6,876 citations· W2165232124 on OpenAlex· 10.1126/science.1136800

Why is this work in the frame?

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

Canadian affiliationAn author listed a Canadian institution. This is the only route the usual frame has.

Abstract

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.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

The record

Venue
Science
Topic
Gene expression and cancer classification
Field
Biochemistry, Genetics and Molecular Biology
Canadian institutions
University of Toronto
Funders
Keywords
Affinity propagationCluster analysisComputer scienceSimilarity (geometry)Data miningSet (abstract data type)Data setData pointCluster (spacecraft)Pattern recognition (psychology)Artificial intelligenceFuzzy clusteringCURE data clustering algorithmImage (mathematics)
Has abstract in OpenAlex
yes