The structure function and distinguishable models of data

Computer Journal

Volumn 49, Issue 6, 2006, Pages 657-664

  Rissanen, Jorma ^a,b  

^a HELSINKI INSTITUTE FOR INFORMATION TECHNOLOGY   (Finland)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); MATHEMATICAL MODELS;

DISTINGUISHABLE MODELS; KOLMOGOROV'S STRUCTURE FUNCTION; SHANNON'S CODING THEORY;

DATA STRUCTURES;

EID: 33750107915     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxl045     Document Type: Article

References (14)

1. Vereshchagin, N. K. and Vitanyi, P. M. B. (2004) Kolmogorov's structure functions and model selection. IEEE Trans. Inform. Theory, IT-50(12), 3265-3290.
2. Solomonoff, R. J. (1960) A Preliminary Report on a General Theory of Inductive Inference. Zator Co, Cambridge, MA, Report ZTB-135.
3. Kolmogorov, A. N. (1965) Three approaches to the quantitative definition of information. Probl Inform Transm., 1, 4-7.
4. Chaitin, G. J. (1969) On the length of programs for computing finite binary sequences. J Altern Complement Med statistical considerations, 16, 145-159.
5. Li, M. and Vitanyi, P.M.B. (1997) An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, New York.
6. Clarke, B. C. and Barron, A. R. (1990) Information-theoretic asymptotics of Bayes methods. IEEE Trans. Inform. Theory, T-36, 453-471.
7. Atteson, K. (1999) The Asymptotic redundancy of Bayes rules for Markov chains. IEEE Trans Inform. Theory, IT-45 (6), 2104-2109.
8. Rissanen, J. (2001) Strong optimality of the normalized ML models as universal codes and information in data. IEEE Trans. Inform. Theory, IT-47(5), 1712-1717.
9. Rissanen, J. (1984) Universal coding, information, prediction, and estimation. IEEE Trans. Inform. Theory, IT-30(4), 629-636.
10. Rissanen, J. (1996) Fisher information and stochastic complexity. IEEE Trans. Inform. Theory, IT-42(1), 40-47.
11. Rissanen, J. (1983) A universal prior for integers and estimation by minimum description length. Ann. Stat., 11(2), 416-431.
12. Rissanen, J. (2006) Information, Complexity, and the MDL Principle. Springer Verlag, New York.
13. Rissanen, J. and Tabus, I. (2005) Kolmogorov structure function in MDL theory and lossy data compression. In Grünwald, P. D., Myung, J. and Pitt, M. A. (eds), Advances in Minimum Description Length: Theory and Applications. A Bradford Book, The MIT Press, Cambridge, MA, Chapter 10.
14. Rissanen, J. (2006) Distinguishable distributions. (to appear).