Acceleration of the EM algorithm using the vector epsilon algorithm
| Autor: | Masahiro Kuroda, Mingfeng Wang, Zhi Geng, Michio Sakakihara |
|---|---|
| Rok vydání: | 2007 |
| Předmět: |
Statistics and Probability
Linde–Buzo–Gray algorithm Freivalds' algorithm Dinic's algorithm InformationSystems_INFORMATIONSYSTEMSAPPLICATIONS Population-based incremental learning ComputerApplications_COMPUTERSINOTHERSYSTEMS Computational Mathematics Ramer–Douglas–Peucker algorithm Computer Science::Multimedia Expectation–maximization algorithm Statistics Probability and Uncertainty Difference-map algorithm Algorithm Mathematics FSA-Red Algorithm |
| Zdroj: | Computational Statistics. 23:469-486 |
| ISSN: | 1613-9658 0943-4062 |
| DOI: | 10.1007/s00180-007-0089-1 |
| Popis: | The expectation---maximization (EM) algorithm is a very general and popular iterative computational algorithm to find maximum likelihood estimates from incomplete data and broadly used to statistical analysis with missing data, because of its stability, flexibility and simplicity. However, it is often criticized that the convergence of the EM algorithm is slow. The various algorithms to accelerate the convergence of the EM algorithm have been proposed. The vector ? algorithm of Wynn (Math Comp 16:301---322, 1962) is used to accelerate the convergence of the EM algorithm in Kuroda and Sakakihara (Comput Stat Data Anal 51:1549---1561, 2006). In this paper, we provide the theoretical evaluation of the convergence of the ?-accelerated EM algorithm. The ?-accelerated EM algorithm does not use the information matrix but only uses the sequence of estimates obtained from iterations of the EM algorithm, and thus it keeps the flexibility and simplicity of the EM algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink