방법 비교

	Mean Shift	계층적 군집화
분야	머신러닝	머신러닝
계열	Machine learning	Machine learning
기원 연도	1975	1963
창시자	Fukunaga, K. & Hostetler, L. D.; extended by Comaniciu, D. & Meer, P.	Ward, J. H.
유형	Non-parametric mode-seeking / density-based clustering	Unsupervised clustering (agglomerative)
원전	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.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
별칭	mean-shift clustering, mean shift mode seeking, kernel mean shift, nonparametric mode detection	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
관련	4	4
요약	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.	Hierarchical clustering is an unsupervised method that groups observations into nested clusters and draws the result as a dendrogram, so the number of clusters need not be fixed in advance. Its agglomerative form rests on the objective-function grouping criterion introduced by Joe Ward in 1963.