On recursive estimation in incomplete data models

Statistics

Volumn 34, Issue 1, 2000, Pages 27-51

  Yao, Jian Feng ^a  

^a University Paris I Sorbonne Panthéon   (France)

Author keywords

EM algorithm; Incomplete data; Mixtures; Recursive estimation; Stochastic algorithm

Indexed keywords

EID: 0346107471     PISSN: 02331888     EISSN: None     Source Type: Journal    
DOI: 10.1080/02331880008802704     Document Type: Article

References (24)

1. Brandière, O. and Duflo, M. (1996) Les algorithmes stochastiques contournent-ils les pièges? Ann. Inst. Henri Poincaré, 32, 395-427.
2. Celeux, G., Chauveau, D. and Diebolt, J. (1996) Stochastic versions of the EM algorithm: an experimental study in the mixture case. J. Statist. Computation and Simulation, 55, 287-314.
3. Celeux, G. and Diebolt, J. (1985) The SEM algorithm: a probabilistic teacher algorithm derived from the EM algorithm for the mixture problem. Computational Statistics Quaterly, 2, 73-82.
4. Chen, H. (1993) Asymptotically efficient stochastic approximation. Stochastics and Stochastics Reports, 45, 1-16.
5. Chen, H., Guo, L. and Gao, A. (1988) Convergence and robustess of the Robbins-Monro algorithm truncated at randomly varying bounds. Stochastic Processes and their Applications, 27, 217-231.
6. Dacunha-Castelle, D. and Gassiat, E. (1997) Testing in locally conic models and applications to mixture models. ESAIM Probab. Statist., 1, 285-317.
7. Dempster, A., Laird, N. and Rubin, D. (1977) Maximum likelihood from incomplete data via the EM algorithm (with discussion). J. Roy. Soc. Stat. B, 39, 1-38.
8. Duflo, M. (1996) Algorithmes Stochastiques. Springer-Verlag, Berlin.
9. Fabian, V. (1978) On asymptotic efficient recursive estimation. Ann. of Stat., 6, 854-856.
10. Fort, J. and Pagès, G. (1996) Convergence of stochastic algotithms: from the Kushner-Clark theorem to the Lyapounov functional method. Adv. Appl. Probab., 28, 1072-1094.
11. Kushner, H. and Clark, D. (1978) Stochastic Approximation for Constrained and Unconstrained Systems. Springer-Verlag, Berlin.
12. Lavielle, M. and Moulines, E. (1995) On a stochastic approximation version of the EM algorithm. Technical Report 95.08, Université Paris-Sud.
13. Meng, X. and van Dyk, D. (1997) The EM algorithm - and old folk-song sung to a fast new tune. J. Royal Statist. Soc., 59, 511-567.
14. Pearson, K. (1894) Contributions to the mathematical theory of evolution. Phil. Trans Royal Soc. A, 185, 71-110.
15. Polyak, B. T. (1990) New stochastic approximation type procedures. Automat. i Telemekh., 7, 98-107. English translation: Automation and remote control 51, 1991.
16. Polyak, B. T. (1990) New stochastic approximation type procedures. Automat. i Telemekh., 7, 98-107. English translation: Automation and remote control 51, 1991.
17. Polyak, B. T. and Juditsky, A. B. (1992) Acceleration of stochastic approximation by averaging. SIAM J. Control and Optimization, 30, 838-855.
18. Qian, W. and Titterington, D. (1991) Estimation of parameters in hidden Markov models. Phil. Trans. R. Soc. Lond., 337, 407-428.
19. Redner, R. and Walker, H. (1984) Mixture densities, maximum likelihood and the EM algorithm, SIAM Review, 26, 195-239.
20. Richardson, S. and Green, P. J. (1997) On Bayesian analysis of mixtures with an unknown number of components (with discussion). J. Roy. Statist. Soc. B, 59, 731-792.
21. Robert, C. (1996) Mixtures of distributions: inference and estimation. In: Gilks, W. R., Richardson, S. and Spiegelhater, D. J., Editors, Markov Chain Monte-Carlo in Pratice, chapter 24, pages 441-464. Chapman and Hall, London.
22. Rydén, T. (1998) Asymptotically efficient recursive estimation for incomplete data models using the observed information. Metrika, 44, 119-145.
23. Titterington, D., Smith, A. and Markov, U. (1985) Statistical Analysis of Finite Mixture Distributions. Wiley, New York.
24. Wei, G. and Tanner, M. (1990) A Monte-Carlo implementation of the EM algorithm and the poor man's data augmentation algorithm. J. American Statist. Association, 85, 699-704.