השוואת שיטות

	אשכול באמצעות התפשטות זיקה	DBSCAN
תחום	למידת מכונה	למידת מכונה
משפחה	Machine learning	Machine learning
שנת המקור	2007	1996
הוגה השיטה	Brendan Frey & Delbert Dueck	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
סוג	Exemplar-based clustering via message passing	Density-based clustering algorithm
מקור מכונן	Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972–976.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.
כינויים	affinity propagation clustering, message-passing clustering, exemplar-based clustering, yakınlık yayılımı kümeleme	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
קשורות	4	3
תקציר	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.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.