Stochastic Complexity in Learning

Journal of Computer and System Sciences

Volumn 55, Issue 1, 1997, Pages 89-95

  Rissanen, J ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MAN MACHINE SYSTEMS; SYSTEMS SCIENCE; TREES (MATHEMATICS);

STOCHASTIC COMPLEXITY;

LEARNING SYSTEMS;

EID: 0031207280     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1501     Document Type: Article

References (20)

1. G. J. Chaitin, On the lengths of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13 (1966), 547-569.
2. G. J. Chaitin, On the lengths of programs for computing finite binary sequences: Statistical considerations, J. Assoc. Comput. Mach. 16 (1969), 145-159.
3. D. Davisson, Universal noiseless coding, IEEE Trans. Inform. Theory IT-19, No. 6 (1973), 783-795.
4. A. N. Kolmogorov, Three approaches to the quantitative definition of information, Probl. Inform. Transmission 1 (1965), 1-7.
5. R. E. Krichevsky and V. K. Trofimov, The performance of universal coding, IEEE Trans. Inform. Theory IT-27, No. 2 (1983), 199-207.
6. M. Lehtokangas, J. Saarinen, P. Huuhtanen, and K. Kaski, Chaotic time series modeling with optimum neural network architecture, in "Proc. of International Joint Conference on Neural networks, IJCNN '93, Nagoya, Japan."
7. M. Li and P. Vitányi, "An Introduction to Kolmogorov Complexity and Its Applications," Springer-Verlag, New York, 1993.
8. R. Nohre, "Some Topics in Descriptive Complexity," Ph.D. thesis, Linkoping University, 1994.
9. J. R. Quinlan and R. L. Rivest, Inferring decision trees using minimum description length principle, Inform. and Comput. 80 (1989), 227-248.
10. J. Rissanen, Universal coding, information, prediction, and estimation, IEEE Trans. Inf. Theory IT-30, No. 4 (1984), 629-636.
11. J. Rissanen, Stochastic complexity and modeling, Annals of Statistics 14 (1986), 1080-1100.
12. J. Rissanen, "Stochastic Complexity in statistical Inquiry," World Scientific, River Edge, NJ, 1989.
13. J. Rissanen and B. Yu, MDL learning, in "The Workshop Learning and Geometry: The Proceedings, Learning and Geometry: Computational Approaches" (D. W. Kueker and C. H. Smith, Eds.), pp. 3-19, Birkhäuser, Basel, 1996.
14. J. Rissanen, Information theory and neural nets, in "Mathematical Perspectives of Neural Networks" (P. Smolensky, M. Mozer, and D. Rumelhart, Eds.), Erlbaum, Hillsdale, NJ, 1992.
15. J. Rissanen, Fisher information and stochastic complexity, IEEE Trans. Inf. Theory IT-42, No. 1 (1996), 40-47.
16. J. Rissanen and M. Wax, "Algorithm for Constructing Tree Structured Classifiers," U.S. Patent No. 4,719,571, 1988.
17. Yu. M. Shtarkov, Universal sequential coding of single messages, Probl. Inform. Transmission 23, No. 3 (1987), 3-17.
18. R. J. Solomonoff, A formal theory of inductive inference, I; II, Inform. and Control 7 (1964), 1-22.
19. K. Yamanishi, A learning criterion for stochastic rules, in "Proc. of the Third Annual Workshop on Computational Learning Theory, August 1990."
20. M. J. Weinberger, J. Rissanen, and M. Feder, A universal finite memory source, IEEE Trans. Inform. Theory IT-41, No. 3 (1995), 643-652.