An exact line search scheme to accelerate the EM algorithm Application to Gaussian mixture models identification
Résumé
This paper tackles the slowness issue of the well-known expectation-maximization (EM) algorithm in the context of Gaussian mixture models. To cope with this slowness problem, an Exact Line Search scheme is proposed. It is based on exact computation of the step size required to jump, for a given search direction, towards the final solution. Computing this exact step size is easily done by only rooting a second-order polynomial computed from the initial log-likelihood maximization problem. Numerical results using both simulated and real dataset showed the efficiency of the proposed exact line search scheme when applied to the conventional EM algorithm as well as the anti-annealing based acceleration techniques based on either the EM or the expectation conjugate gradient algorithm. © 2020 Elsevier B.V.
Fichier principal
Xiang -2020_An exact line search scheme to accelerate the EM algorithm Application to Gaussian mixture models identification.pdf (1.85 Mo)
Télécharger le fichier
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...