On Convergence Problems of the EM Algorithm for Finite Gaussian Mixtures
(2003) ESANN 2003, European Symposium on Artificial Neural Networks — Location: Bruges (Belgium) (23.April.2003)
Files
76-OnConvergenceProblemsoftheEMAlgorithmforFiniteGaussianMixtures.pdf
Restricted Access - Adobe PDF
- 684.84 KB
Details
- Authors
- Abstract
- Efficient probability density function estimation is of primary interest in statistics. A popular approach for achieving this is the use of finite Gaussian mixture models. Based on the expectation-maximization algorithm, the maximum likelihood estimates of the model parameters can be iteratively computed in an elegant way. Unfortunately, in some cases the algorithm is not converging properly because of numerical difficulties. They are of two kinds: they can be associated to outliers or to repeated data samples. In this paper, we trace and discuss their origin while providing some theoretical evidence. As a matter of fact, both can be explained by the concept of isolation, which is leading to the width of the collapsing mixture component to become zero.
- Affiliations
Citations
Archambeau, C., Lee, J., & Verleysen, M. (2003). On Convergence Problems of the EM Algorithm for Finite Gaussian Mixtures. Proceedings of ESANN 2003, European Symposium on Artificial Neural Networks, p. 99-106. https://hdl.handle.net/2078.5/253994