Jämför metoder

	Hierarkisk klustring	Faktoriell analys	Gaussisk blandningsmodell
Ämnesområde	Maskininlärning	Forskningsstatistik	Maskininlärning
Familj	Machine learning	Process / pipeline	Machine learning
Ursprungsår	1963	1931	1977
Upphovsperson	Ward, J. H.	Louis Leon Thurstone	Dempster, Laird & Rubin (EM algorithm)
Typ	Unsupervised clustering (agglomerative)	Method	Probabilistic (soft) clustering — mixture model
Ursprungskälla	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.	Thurstone, L. L. (1947). Multiple Factor Analysis. University of Chicago Press.	Dempster, A.P., Laird, N.M. & Rubin, D.B. (1977). Maximum Likelihood from Incomplete Data via the EM Algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–22.
Alias	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering	EFA, CFA, latent variable modeling	Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians
Närliggande	4	3	4
Sammanfattning	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.	Factor analysis is a statistical technique for identifying latent (unobserved) dimensions underlying observed variables, developed by Louis Leon Thurstone in the 1930s and formalized by Jöreskog (1969). Exploratory factor analysis (EFA) discovers unknown factor structure from data; confirmatory factor analysis (CFA) tests hypothesized relationships between observed and latent variables. Essential in psychometrics (test development), organizational research (measuring constructs like leadership style), and biomedicine (identifying disease subtypes), factor analysis reduces dimensionality while revealing conceptual organization in multivariate data.	A Gaussian Mixture Model is a probabilistic clustering method that models the data as a weighted mixture of several Gaussian distributions, fitted with the Expectation–Maximization algorithm formalized by Dempster, Laird & Rubin in 1977. It is a generalization of K-means in which each cluster can take its own shape, size, and orientation.