The optimal error exponent for Markov order estimation

IEEE Transactions on Information Theory

Volumn 42, Issue 5, 1996, Pages 1488-1497

  Finesso, Lorenzo ^b   Liu, Chuang Chun ^c   Narayan, Prakash ^a,d  

^a IEEE

^b Istituto di Ingeneria Biomedica del CNR   (Italy)

^c IBM ALMADEN RESEARCH CENTER   (United States)

^d UNIVERSITY OF MARYLAND   (United States)

Author keywords

Error exponent; Hypothesis testing; Markov order; Order estimation

Indexed keywords

ERRORS; ESTIMATION; MARKOV PROCESSES; OPTIMIZATION; PROBABILITY; RECURSIVE FUNCTIONS; STATISTICS; TESTING;

HYPOTHESIS TESTING; OPTIMAL ERROR EXPONENT;

INFORMATION THEORY;

EID: 0030243475     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.532889     Document Type: Article

References (20)

1. P. Billingsley, "Statistical methods in Markov chains," Ann. Math. Statist., vol. 32, pp. 12-40; Correction: p. 1343, 1961.
2. C. Chatfield, "Statistical inference regarding Markov chain models," Appl. Statist., vol. 22, pp. 7-20, 1973.
3. J. C. Kieffer, "Strongly consistent code-based identification and order estimation for constrained finite-state model classes," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 893-902, May 1993.
4. N. Merhav, M. Gutman, and J. Ziv, "On the estimation of the order of a Markov chain and universal data compression," IEEE Trans. Inform. Theory, vol. 35, pp. 1014-1019, 1989.
5. J. Rissanen, "Complexity of strings in the class of Markov sources," IEEE Trans. Inform. Theory, vol. IT-32, pp. 526-532, 1986.
6. H. Tong, "Determination of the order of a Markov chain by Akaike's information criterion," J. Appl. Probab., vol. 12, pp. 488-497, 1975.
7. J. Rissanen, Stochastic Complexity in Statistical Enquiry. Singapore: World Scientific, 1989.
8. C. Liu and P. Narayan, "Order estimation and sequential universal data compression of a hidden Markov source via the method of mixtures," IEEE Trans. Inform. Theory, vol. 40, no. 4, pp. 1167-1180, July 1994.
9. J. Ziv and N. Merhav, "Estimating the number of states of a finite-state source," IEEE Trans. Inform. Theory, vol. 38, pp. 61-65, 1992.
10. L. D. Davisson, R. J. McEliece, M. B. Pursley, and M. S. Wallace, "Efficient universal noiseless source codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 269-279, 1981.
11. Y. M. Shtar'kov, "Universal sequential coding of separate messages," Probl. Pered. Inform., vol. 23, pp. 3-17, 1987.
12. L. D. Davisson, O. Longo, and A. Sgarro, "The error exponent for the noiseless encoding of finite ergodic Markov sources," IEEE Trans. Inform. Theory, vol. IT-27, pp. 431-438, 1981.
13. M. Gutman, "Asymptotically optimal classification for multiple tests with empirically observed statistics," IEEE Trans. Inform. Theory, vol. 35, pp. 401-4108, 1989.
14. V. Anantharam, "A large deviation approach to error exponents in source coding and hypothesis testing," IEEE Trans. Inform. Theory, vol. IT-27, pp. 938-943, 1981.
15. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications. Boston, MA: Jones and Bartlett, 1993.
16. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic Press, 1981.
17. M. D. Donsker and S. R. S. Varadhan, "Asymptotic evaluation of certain Markov process expectations for large time I-III," Comm. Proc. App. Math., vol. 28, pp. 1-47, 279-301,
18. and M. D. Donsker and S. R. S. Varadhan, Comm. Proc. App. Math., vol. 29, pp. 389-461, 1975/1976.
19. I. Csiszár, "Information theoretical methods in statistics," Class notes, University of Maryland, College Park, MD, Spring 1990.
20. L. Finesso, "Estimation of the order of a finite Markov chain," in Recent Advances in the Mathematical Theory of Systems, Control, Networks Signals, Proc. MTNS-91, H. Kimura and S. Kodama, Eds. Mita Press, 1992, pp. 643-645.