Clustering by Passing Messages Between Data Points

@article{Frey2007ClusteringBP,
  title={Clustering by Passing Messages Between Data Points},
  author={B. Frey and D. Dueck},
  journal={Science},
  year={2007},
  volume={315},
  pages={972 - 976}
}
  • B. Frey, D. Dueck
  • Published 2007
  • Computer Science, Medicine
  • Science
    • 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… CONTINUE READING
    View on AAAS
    people.csail.mit.edu
    5,230 Citations
    Highly Influencial Citations
    510
    Background Citations
    1,175
    Methods Citations
    2,084
    Results Citations
    38

    Supplemental Content

    6:11
    Video
    Affinity propagation-Part 2
    latesummer2009
    25 September 2015
    Presentation Slides
    Clustering by Passing Messages Between Data Points

    Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Paper Mentions

    Blog Post
    Affinity Propagation
    Thirst for Science
    4 April 2008
    5,230 Citations
    Citation Type

    Citation Type

    Clustering by propagating probabilities between data points
    • 9
    Affinity Propagation: Clustering Data by Passing Messages
    • 116
    • PDF
    Local and global approaches of affinity propagation clustering for large scale data
    • 46
    • PDF
    Sparse Affinity Propagation for Image Analysis
    • 4
    • PDF
    Clustering by fast search and find of density peaks
    • 1,068
    • PDF
    An improved affinity propagation clustering algorithm for large-scale data sets
    • 7
    A hierarchical clustering algorithm based on noise removal
    • 5
    Beyond affinity propagation: message passing algorithms for clustering
    • 16
    • PDF
    Clustering of Categorical Data for Anonymization and Anomaly Detection
    • PDF
    Clustering for point pattern data
    • 12
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 48 REFERENCES
    Some methods for classification and analysis of multivariate observations
    • 21,836
    • PDF
    Normalized cuts and image segmentation
    • Jianbo Shi, J. Malik
    • Mathematics, Computer Science
    • Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition
    • 1997
    • 12,025
    • PDF
    A Constant-Factor Approximation Algorithm for the k-Median Problem
    • 511
    • PDF
    Factor graphs and the sum-product algorithm
    • 3,641
    • PDF
    Constructing free-energy approximations and generalized belief propagation algorithms
    • 1,554
    • PDF
    Genome-wide analysis of mouse transcripts using exon microarrays and factor graphs
    • 50
    • PDF
    A Split-Merge Markov chain Monte Carlo Procedure for the Dirichlet Process Mixture Model
    • 440
    Neural networks and physical systems with emergent collective computational abilities.
    • J. Hopfield
    • Computer Science, Medicine
    • Proceedings of the National Academy of Sciences of the United States of America
    • 1982
    • 12,608
    • PDF
    NCBI Reference Sequence Project: update and current status
    • 180
    • PDF
    Good Error-Correcting Codes Based on Very Sparse Matrices
    • D. MacKay
    • Mathematics, Computer Science
    • IEEE Trans. Inf. Theory
    • 1999
    • 2,104
    • PDF