Porównaj metody

	Klasteryzacja przez propagację powinowactwa	Klasteryzacja K-średnich	Klastrowanie spektralne
Dziedzina	Uczenie maszynowe	Uczenie maszynowe	Uczenie maszynowe
Rodzina	Machine learning	Machine learning	Machine learning
Rok powstania	2007	1967	2002
Twórca	Brendan Frey & Delbert Dueck	MacQueen, J.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
Typ	Exemplar-based clustering via message passing	Partitional clustering (centroid-based)	Graph-based clustering (spectral method)
Źródło pierwotne	Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972–976.	MacQueen, J. (1967). Some Methods for Classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, 281–297.	Ng, A. Y., Jordan, M. I., & Weiss, Y. (2002). On Spectral Clustering: Analysis and an Algorithm. Advances in Neural Information Processing Systems, 14, 849–856.
Inne nazwy	affinity propagation clustering, message-passing clustering, exemplar-based clustering, yakınlık yayılımı kümeleme	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
Pokrewne	4	3	5
Podsumowanie	Affinity propagation, introduced by Brendan Frey and Delbert Dueck in 2007, is a clustering algorithm that identifies representative 'exemplars' among the data by exchanging messages between every pair of points until a consistent set of clusters emerges. Unlike k-means it does not require the number of clusters to be specified in advance — that number arises from the data and a 'preference' parameter — and it works directly from pairwise similarities, which need not be a metric.	K-Means Clustering is a centroid-based partitional clustering algorithm, traced to J. MacQueen in 1967, that splits data into k clusters by assigning each observation to its nearest cluster centre. It is widely used for marketing segmentation, customer grouping, and exploratory analysis.	Spectral Clustering is a graph-based unsupervised learning algorithm, formalized by Ng, Jordan, and Weiss in 2002, that maps data points into a low-dimensional eigenspace derived from the similarity graph's Laplacian before applying k-means. This spectral embedding makes it possible to recover clusters of arbitrary shape — rings, crescents, interleaved spirals — that Euclidean distance-based methods consistently fail to separate.