On Convergence Properties of the EM Algorithm for Gaussian Mixtures
"Expectation-Maximization'' (EM) algorithm and gradient-based approaches for maximum likelihood learning of finite Gaussian mixtures. We show that the EM step in parameter space is obtained from the gradient via a projection matrix $P$, and we provide an explicit expression for...
Main Authors: | Jordan, Michael, Xu, Lei |
---|---|
Language: | en_US |
Published: |
2004
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/7195 |
Similar Items
-
Learning from Incomplete Data
by: Ghahramani, Zoubin, et al.
Published: (2004) -
Generating Multi-Codebook Neural Network by Using Intelligent Gaussian Mixture Model Clustering Based on Histogram Information for Multi-Modal Data Classification
by: M. Anwar Ma'Sum, et al.
Published: (2024-01-01) -
Average Entropy of Gaussian Mixtures
by: Basheer Joudeh, et al.
Published: (2024-08-01) -
Analyzing skewed financial data using skew scale-shap mixtures of multivariate normal distributions
by: Mostafa Tamandi, et al.
Published: (2024-08-01) -
The whole and its parts: Visualizing Gaussian mixture models
by: Joachim Giesen, et al.
Published: (2024-06-01)