مقایسهٔ روش‌ها

	مدل آمیخته گوسی	خوشه‌بندی سلسله‌مراتبی
حوزه	یادگیری ماشین	یادگیری ماشین
خانواده	Machine learning	Machine learning
سال پیدایش	1977	1963
پدیدآور	Dempster, Laird & Rubin (EM algorithm)	Ward, J. H.
نوع	Probabilistic (soft) clustering — mixture model	Unsupervised clustering (agglomerative)
منبع بنیادین	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.	Ward, J. H. (1963). Hierarchical Grouping to Optimize an Objective Function. Journal of the American Statistical Association, 58(301), 236–244.
نام‌های دیگر	Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians	Hiyerarşik Kümeleme, hiyerarşik kümeleme, agglomerative clustering, hierarchical agglomerative clustering
مرتبط	4	4
خلاصه	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.	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.