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

	কে-মিনস ক্লাস্টারিং	স্পেকট্রাল ক্লাস্টারিং
ক্ষেত্র	যন্ত্র শিখন	যন্ত্র শিখন
পরিবার	Machine learning	Machine learning
উদ্ভবের বছর	1967 (formalized 1982)	2002
প্রবর্তক	MacQueen, J. B.; Lloyd, S. P.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
ধরন	Partitional clustering	Graph-based clustering (spectral method)
মৌলিক উৎস	Lloyd, S. P. (1982). Least squares quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129–137.	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.
অপর নাম	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
সম্পর্কিত	4	5
সারসংক্ষেপ	K-means is a classic unsupervised partitional clustering algorithm that divides a dataset into K non-overlapping groups by iteratively assigning each observation to its nearest centroid and updating centroids as the mean of their assigned points. It is one of the most widely used exploratory tools in machine learning and data 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.