Порівняння методів

	Гаусова сумішева модель	DBSCAN	Метод головних компонент
Галузь	Машинне навчання	Машинне навчання	Машинне навчання
Родина	Machine learning	Machine learning	Machine learning
Рік появи	1977	1996	2002
Автор методу	Dempster, Laird & Rubin (EM algorithm)	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X.	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
Тип	Probabilistic (soft) clustering — mixture model	Density-based clustering algorithm	Unsupervised dimensionality reduction
Основоположне джерело	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.	Ester, M., Kriegel, H.-P., Sander, J. & Xu, X. (1996). A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd KDD, 226–231.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.
Інші назви	Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians	DBSCAN Kümeleme, density-based clustering, density-based spatial clustering	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
Пов'язані	4	3	3
Підсумок	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.	DBSCAN is a density-based clustering algorithm, introduced by Ester, Kriegel, Sander and Xu in 1996, that groups together points lying in dense regions and flags points in sparse regions as noise. It is effective on noisy data and on clusters of irregular, non-spherical shapes.	Principal Component Analysis (PCA) is an unsupervised dimensionality-reduction method — given its modern textbook treatment by Ian Jolliffe (2002) — that compresses high-dimensional data into fewer dimensions while preserving the maximum possible variance. It re-expresses correlated variables as a small set of uncorrelated principal components ordered by how much of the data's variation each one captures.