Lesson plan
Affinity propagation
In statistics and data mining, affinity propagation (AP) is a clustering algorithm based on the concept of "message passing" between data points. Unlike clustering algorithms such as -means or -medoids, affinity propagation does not require the number of clusters to be determined or estimated before running the algorithm. Similar to -medoids, affinity propagation finds "exemplars," members of the input set that are representative of clusters.
Article summary
In statistics and data mining, affinity propagation (AP) is a clustering algorithm based on the concept of "message passing" between data points. Unlike clustering algorithms such as -means or -medoids, affinity propagation does not require the number of clusters to be determined or estimated before running the algorithm. Similar to -medoids, affinity propagation finds "exemplars," members of the input set that are representative of clusters.
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.