পদ্ধতির তুলনা করুন

	Mean Shift	স্পেকট্রাল ক্লাস্টারিং
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1975	2002
প্রবর্তক	Fukunaga, K. & Hostetler, L. D.; extended by Comaniciu, D. & Meer, P.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
ধরন	Non-parametric mode-seeking / density-based clustering	Graph-based clustering (spectral method)
মৌলিক উৎস	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.	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.
অপর নাম	mean-shift clustering, mean shift mode seeking, kernel mean shift, nonparametric mode detection	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
সম্পর্কিত	4	5
সারসংক্ষেপ	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.	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.