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

	دی‌بی‌اسکن	خوشه‌بندی K-Means
حوزه	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning
سال پیدایش	1996	1967
پدیدآور	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	MacQueen, J.
نوع	Density-based clustering algorithm	Partitional clustering (centroid-based)
منبع بنیادین	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.
نام‌های دیگر	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	K-Ortalamalar Kümeleme, k-ortalamalar kümeleme, k-means, centroid clustering
مرتبط	3	3
خلاصه	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.