विधियों की तुलना करें

	गाऊसी मिश्रण मॉडल	प्रिंसिपल कंपोनेंट एनालिसिस
क्षेत्र	मशीन अधिगम	मशीन अधिगम
परिवार	Machine learning	Machine learning
उद्भव वर्ष	1977	2002
प्रवर्तक	Dempster, Laird & Rubin (EM algorithm)	Jolliffe, I.T. (textbook); Pearson & Hotelling (origins)
प्रकार	Probabilistic (soft) clustering — mixture model	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.	Jolliffe, I.T. (2002). Principal Component Analysis (2nd ed.). Springer.
उपनाम	Gaussian Karışım Modeli (GMM Kümeleme), GMM, GMM clustering, mixture of Gaussians	Temel Bileşenler Analizi (PCA), PCA, principal components analysis, Karhunen-Loève transform
संबंधित	4	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.	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.