Сравнение методов

	Mean Shift	DBSCAN
Область	Машинное обучение	Машинное обучение
Семейство	Machine learning	Machine learning
Год появления	1975	1996
Автор метода	Fukunaga, K. & Hostetler, L. D.; extended by Comaniciu, D. & Meer, P.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.
Тип	Non-parametric mode-seeking / density-based clustering	Density-based clustering algorithm
Основополагающий источник	Fukunaga, K. & Hostetler, L. D. (1975). The estimation of the gradient of a density function, with applications in pattern recognition. IEEE Transactions on Information Theory, 21(1), 32–40.	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.
Другие названия	mean-shift clustering, mean shift mode seeking, kernel mean shift, nonparametric mode detection	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering
Связанные	4	3
Сводка	Mean Shift is a non-parametric, iterative mode-seeking algorithm that identifies clusters as the peaks of an underlying probability density function. Originally introduced by Fukunaga and Hostetler (1975) for gradient estimation in pattern recognition, it was substantially extended and popularized by Comaniciu and Meer (2002) for robust feature-space analysis and image segmentation. Unlike k-means, Mean Shift requires no prior specification of the number of clusters, deriving cluster structure entirely from the data density.	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.