مقایسهٔ روش‌ها

	دی‌بی‌اسکن	خوشه‌بندی K-Means	خوشه‌بندی طیفی (Spectral Clustering)
حوزه	یادگیری ماشین	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning	Machine learning
سال پیدایش	1996	1967	2002
پدیدآور	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	MacQueen, J.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
نوع	Density-based clustering algorithm	Partitional clustering (centroid-based)	Graph-based clustering (spectral method)
منبع بنیادین	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.	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.
نام‌های دیگر	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
مرتبط	3	3	5
خلاصه	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.	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.