A modified EM algorithm for mixture models based on Bregman divergence
From MaRDI portal
Recommendations
- Generalized EM Algorithms for Minimum Divergence Estimation
- Theory and use of the EM algorithm
- Statistical convergence of the EM algorithm on Gaussian mixture models
- A two-step proximal-point algorithm for the calculus of divergence-based estimators in finite mixture models
- Another interpretation of the EM algorithm for mixture distributions
Cites work
- scientific article; zbMATH DE number 1817585 (Why is no real title available?)
- scientific article; zbMATH DE number 3954047 (Why is no real title available?)
- scientific article; zbMATH DE number 1059776 (Why is no real title available?)
- scientific article; zbMATH DE number 1560711 (Why is no real title available?)
- Information Geometry of U-Boost and Bregman Divergence
- Maximum likelihood estimation via the ECM algorithm: A general framework
- Robust Blind Source Separation by Beta Divergence
- Robust estimation in the normal mixture model
- Robustifying AdaBoost by Adding the Naive Error Rate
- The EM Algorithm and Related Statistical Models
Cited in
(7)- Geometry of EM and related iterative algorithms
- Alternating minimization algorithm with a probability generating function-based distance measure
- Information geometry approach to parameter estimation in hidden Markov model
- A two-step proximal-point algorithm for the calculus of divergence-based estimators in finite mixture models
- Learning continuous latent variable models with Bregman divergences
- Reverse EM-problem based on Bregman divergence and its application to classical and quantum information theory
- An estimation of generalized Bradley-Terry models based on the EM algorithm
This page was built for publication: A modified EM algorithm for mixture models based on Bregman divergence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878191)
