Machine learning

Gaussian Mixture Model

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.

MethodMind'de açSoonVideoSoon

Tam yöntemi oku

Members only

Sign in with a free account to read this section.

Sign in

Sources

  1. 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. DOI: 10.1111/j.2517-6161.1977.tb01600.x

Related methods

Referenced by

ScholarGateGaussian Mixture Model (Gaussian Mixture Model (GMM Clustering)). Retrieved 2026-06-04 from https://scholargate.app/tr/machine-learning/gaussian-mixture