Porównaj metody

	Klasteryzacja hierarchiczna	Grupowanie K-średnich (K-means Clustering)	Klastrowanie spektralne
Dziedzina	Uczenie maszynowe	Uczenie maszynowe	Uczenie maszynowe
Rodzina	Machine learning	Machine learning	Machine learning
Rok powstania	1963	1967 (formalized 1982)	2002
Twórca	Ward, J. H.	MacQueen, J. B.; Lloyd, S. P.	Ng, A. Y.; Jordan, M. I.; Weiss, Y.
Typ	Unsupervised clustering (agglomerative)	Partitional clustering	Graph-based clustering (spectral method)
Źródło pierwotne	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.	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.
Inne nazwy	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering	k-means clustering, Lloyd's algorithm, k-means partitioning, hard k-means	NJW spectral clustering, graph Laplacian clustering, normalized spectral clustering, spectral graph clustering
Pokrewne	4	4	5
Podsumowanie	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.	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.