An Interval Analysis Approach to the EM Algorithm

Journal of Computational and Graphical Statistics

Volumn 9, Issue 2, 2000, Pages 303-318

  Wright, Kevin ^a   Kennedy, William J ^b  

^a PIONEER HI BRED INTERNATIONAL INC   (United States)

^b Iowa State University   (United States)

Author keywords

Interval arithmetic; Interval EM; Maximum likelihood; Optimization

Indexed keywords

EID: 23044519568     PISSN: 10618600     EISSN: 15372715     Source Type: Journal    
DOI: 10.1080/10618600.2000.10474882     Document Type: Article

References (12)

1. Arslan, O., Constable, P. D. L., and Kent, J. T. (1993), “Domains of Convergence for the EM Algorithm: A Cautionary Tale in a Location Estimation Problem,” Statistical Computing, 3, 103-108.
2. Dempster, A. P., Laird, N. M., and Rubin, D. B. (1977), “Maximum Likelihood From Incomplete Data via the EM Algorithm,” Journal of the Royal Statistical Society, Series B, 39, 1-22.
3. Hansen, E. (1992), Global Optimization Using Interval Analysis, New York: Marcel Dekker Inc.
4. Hansen, E. (1997), “Sharpness in Interval Computations,” Reliable Computing, 3, 17-29.
5. Kearfott, R. B. (1996), Rigorous Global Search: Continuous Problems, Amsterdam: Kluwer Academic Publishers.
6. Knilppel, O. (1993), “PROF1L-Programmer’s Runtime Optimized Fast Interval Library,” Technical Report 93.4, Informationstechnik, Technische Uni. Hamburg-Harburg.
7. Knilppel, O. (1994), “PROFIL/BIAS-A Fast Interval Library," Computing, 53, 277-287.
8. McLachlan, G. J., and Krishnan, T. (1997), The EM Algorithm and Extensions, New York: Wiley.
9. Moore, R. E. (1966), Interval Analysis, Englewood Cliffs, NJ: Prentice-Hall.
10. Moore, R. E. (1979), Methods and Applications of Interval Analysis, Philadelphia: SIAM.
11. Thisted, R. A. (1988). Elements of Statistical Computing, New York: Chapman and Hall.
12. Wu, C. F. J. (1982), “On the Convergence Properties of the EM Algorithm,” The Annals of Statistics, 11, 95-103.