Stochastic complexity and model selection from incomplete data

Journal of Statistical Planning and Inference

Volumn 76, Issue 1-2, 1999, Pages 273-284

  Bueso, M C ^a   Qian, G ^b   Angulo, J M ^a  

^a UNIVERSITY OF GRANADA   (Spain)

^b LA TROBE UNIVERSITY   (Australia)

Author keywords

62B10; 62M30; EM algorithm; Incomplete data; Minimum description length; Model selection; Stochastic complexity

Indexed keywords

EID: 0002715328     PISSN: 03783758     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0378-3758(98)00112-8     Document Type: Article

References (21)

1. Alonso F.J., Angulo J.M., Bueso M.C. Estimation and smoothing from incomplete data for a class of lattice processes. Commun. Statist. Theory Methods. 25(3,):1996;667-681.
2. Boyles R.A. On the convergence of the EM algorithm. J. Roy. Statist. Soc., Ser. B. 45(1):1983;47-50.
3. Cressie N.A.C. Statistics for Spatial Data. 1991;Wiley, New York.
4. Dempster A.P., Laird N.M., Rubin D.B. Maximum likelihood from incomplete data via the EM algorithm (with discussions). J. Roy. Statist. Soc., Ser. B. 39:1977;1-38.
5. Haining R., Griffith D., Bennett R. Maximum likelihood estimation with missing spatial data and with application to remotely sensed data. Commun. Statist. Theory Methods. 18(5):1989;1875-1894.
6. Little R.J.A., Rubin D.B. Statistical Analysis with Missing Data. 1987;Wiley, New York.
7. Martin R.J. A subclass of lattice processes applied to a problem in planar sampling. Biometrika. 66(2):1979;209-217.
8. Martin R.J. Information loss due to incomplete data from a spatial gaussian one-parameter first-order conditional process. Commun. Statist. Theory Methods. 18(12):1989;4631-4645.
9. McLachlan G.J., Krishnan T. The EM Algorithm and Extensions. 1997;Wiley, New York.
10. Meng X.L. On the rate of convergence of the ECM algorithm. Ann. Statist. 22(1):1994;326-339.
11. Meng X.L., Rubin D.B. Using EM to obtain asymptotic variance-covariance matrices. The SEM algorithm. J. Amer. Statist. Assoc. 86(416):1991;899-909.
12. Meng X.L., Rubin D.B. Maximum likelihood estimation via the ECM algorithm: a general framework. Biometrika. 80:1993;267-278.
13. Qian, G., Künsch, H., 1998. Some notes on Rissanen's stochastic complexity. IEEE Trans. Inform. Theory 44, in press.
14. Qian G., Gabor G., Gupta R.P. Test for homogeneity of several populations by stochastic complexity. J. Statist. Plan. Inference. 53:1996;133-151.
15. Rissanen J. A universal prior for integers and estimation by minimum description length. Ann. Statist. 11:1983;416-431.
16. Rissanen J. Stochastic complexity and modeling. Ann. Statist. 14(3):1986;1080-1100.
17. Rissanen J. Stochastic complexity (with discussion). J. Roy. Statist. Soc., Ser. B. 49(3,):1987;223-265.
18. Rissanen J. Stochastic Complexity in Statistical Inquiry. 1989;World Scientific Publishing Co. Pte Ltd, Singapore.
19. Rissanen J. Fisher information and stochastic complexity. IEEE Trans. Inform. Theory. 42:1996;40-47.
20. Tanner M.A., 1996. Tools for Statistical Inference, 3rd ed. Springer, New York.
21. Wu C.F.J. On the convergence properties of the EM algorithm. Ann. Statist. 11(1):1983;95-103.