Model selection via information criteria

Periodica Mathematica Hungarica

Volumn 51, Issue 1, 2005, Pages 99-117

  Talata, Zsolt ^a,b  

^a Hungarian Academy of Sciences ^*

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

Basic neighborhood estimation; Bayesian information criterion; Context tree estimation; Information criterion; Markov random field; Minimum description length; Model selection

Indexed keywords

EID: 30844464114     PISSN: 00315303     EISSN: 15882829     Source Type: Journal    
DOI: 10.1007/s10998-005-0023-7     Document Type: Article

References (36)

1. H. AKAIKE, Statistical predictor identification, Ann. Inst. Statist. Math. 22 (1970), 203-217.
2. H. AKAIKE, Information theory and an extension of the maximum likelihood principle, in: Proceedings of the 2nd International Symposium on Information Theory, Supplement to Problems of control and information theory (ed. by B. N. Petrov and F. Csáki), Akadémia Kiadó, Budapest, 1972, 267-281.
3. H. AKAIKE, A new look at the statistical model identification, IEEE Trans. Automat. Contr. 19 (1974), 716-723.
4. H. AKAIKE, On entropy maximization principle, in: Application of statistics (ed. by P. R. Krishnaiah), North-Holland, Amsterdam, 1977, 27-41.
5. T. W. ANDERSON, The choice of the degree of a polynomial regression as a multiple decision problem, Ann. Math. Statist. 33 (1962), 255-265.
6. T. W. ANDERSON, Determination of the order of dependence in normally distributed time series, in: Time series analysis (ed. by M. Rosenblatt), Wiley, New York, 1963, 425-446.
7. J. BESAG, Spatial interaction and the statistical analysis of lattice systems, J. Roy. Statist. Soc. Ser. B 36 (1974), 192-236.
8. F. COMETS, On consistency of a class of estimators for exponential families of Markov random fields on the lattice, Ann. Statist. 20 (1992), 455-468.
9. I. CSISZÁR, Large-scale typicality of Markov sample paths and consistency of MDL order estimators, IEEE Trans. Inform. Theory 48 (2002), 1616-1629.
10. I. CSISZÁR and P. C. SHIELDS, The consistency of the BIC Markov order estimator, Ann. Statist. 28 (2000), 1601-1619.
11. I. CSISZÁR. and ZS. TALATA, Consistent estimation of the basic neighborhood of Markov random fields, Ann. Statist. (2005a), (accepted for publication).
12. I. CSISZÁR and ZS. TALATA, Context tree estimation for not necessarily finite memory processes, via BIC and MDL, IEEE Trans. Inform. Theory, (2005b), (accepted for publication).
13. L. D. DAVISSON, Prediction error of stationary Gaussian time series of unknown variance, IEEE Trans. Inform. Theory 19 (1965), 783-795.
14. L. FINESSO, Estimation of the order of a finite Markov chain, in: Recent advances in mathematical theory of systems, control, networks and signal processing, I (ed. by H. Kimura and S. Kodama), Mita Press, Tokyo, 1992, 643-645.
15. L. GERENCSÉR, Order estimation of stationary Gaussian ARMA processes using Rissanen's complexity, Working paper, Computer and Automation Institute of the Hungarian Academy of Sciences, 1987.
16. E. J. HANNAN, The estimation of the order of an ARMA process, Ann. Statist. 8 (1980), 1071-1081.
17. E. J. HANNAN and B. G. QUINN, The determination of the order of an autoregression, J. Roy. Statist. Soc. Ser. B 41 (1979), 190-195.
18. D. HAUGHTON, On the choice of model to fit data from an exponential family, Ann. Statist. 16 (1988), 342-355.
19. E. M. HEMERLY and M. H. A. DAVIS, Strong consistency of the PLS criterion for order determination of autoregressive processes, Ann. Statist. 17 (1989), 941-946.
20. R. E. KRICHEVSKY and V. K. TROFIMOV, The performance of universal encoding, IEEE Trans. Inform. Theory 27 (1981), 199-207.
21. C. MALLOWS, Choosing variables in a linear regression: A graphical aid, Presented at the Central Regional Meeting of the IMS, Manhattan, Kansas, 1964.
22. p, Technometrics 15 (1973), 661-675.
23. J. NEYMAN and E. S. PEARSON, On the use and interpretation of certain test criteria for purposes of statistical inference, Part II, Biometrika 20A (1928), 263-294.
24. J. RISSANEN, Modeling by shortest data description, Automatica 14 (1978),465-471.
25. J. RISSANEN, A universal prior for integers and estimation by minimum description length, Ann. Statist. 11 (1983a), 416-431.
26. J. RISSANEN, A universal data compression system, IEEE Trans. Inform. Theory 29 (1983b), 656-664.
27. J. RISSANEN, Stochastic complexity in statistical inquiry, World Scientific, Singapore, 1989.
28. J. RISSANEN, Fisher information and stochastic complexity, IEEE Trans. Inform. Theory 42 (1996), 40-47.
29. G. SCHWARZ, Estimating the dimension of a model, Ann. Statist. 6 (1978), 461-464.
30. R. SHIBATA, Selection of the order of an autoregressive model by Akaike's information criterion, Biometrika 63 (1976), 117-126.
31. J. SHTARKOV, Coding of discrete sources with unknown statistics, in: Topics in information theory (ed. by I. Csiszár and P. Elias), North-Holland, Amsterdam, 1977, 559-574.
32. M. STONE, Cross-validatory choice and assessment of statistical predictions, J. Roy. Statist. Soc. Ser. B 36 (1974), 111-147.
33. M. STONE, An asymptotic equivalence of choice of model by cross-validation and Akaike's criterion, J. Roy. Statist. Soc. Ser. B 39 (1977), 44-47.
34. F. M. J. WILLEMS, Y. M. SHTARKOV and T. J. TJALKENS, The context-tree weighting method: Basic properties, Tech. Rep., EE Dept., Eindhoven University, 1993; An earlier unabridged version of Willems, Shtarkov and Tjalkens, 1995.
35. F. M. J. WILLEMS, Y. M. SHTARKOV and T. J. TJALKENS, The context-tree weighting method: Basic properties, IEEE Trans. Inform. Theory 41 (1995), 653-664.
36. F. M. J. WILLEMS, Y. M. SHTARKOV and T. J. TJALKENS, Context-tree maximizing, in: Proc. 2000 Conf. Information Sciences and Systems, TP6-7-TP6-12, Princeton, NJ, 2000.