Learning about the Parameter of the Bernoulli Model

Journal of Computer and System Sciences

Volumn 55, Issue 1, 1997, Pages 96-104

  Vovk, V G ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES; STATISTICAL METHODS; STATISTICS;

BERNOULLI MODEL;

LEARNING SYSTEMS;

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

References (12)

1. A. P. Dawid, Fisherian inference in likelihood and prequential frames of reference (with discussion), J. R. Statist. Soc. B 53 (1991), 79-109.
2. A. P. Dawid, Prequential analysis, stochastic complexity and Bayesian inference, in "Bayesian Statistics 4" (J. M. Bernardo, J. Berger, A. P. Dawid, and A. F. M. Smith, Eds.), Oxford Univ. Press, Oxford, 1992.
3. M. Li and P. Vitányi, "An Introduction to Kolmogorov Complexity and Its Applications," Springer-Verlag, New York, 1993.
4. J. Rissanen, A universal prior for integers and estimation by minimum description length, Ann. Statist. 11 (1983), 416-431.
5. J. Rissanen, Universal coding, information, prediction, and estimation, IEEE Trans. Inform. Theory 30 (1984), 629-636.
6. J. Rissanen, Minimum-description-length principle, in "Encyclopedia of Statistical Sciences" (S. Kotz and N. L. Johnson, Eds.), Vol. 5, pp. 523-527, Wiley, New York, 1985.
7. J. Rissanen, Stochastic complexity and modeling, Ann. Statist. 14 (1986), 1080-1100.
8. J. Rissanen, Stochastic complexity (with discussion), J. R. Statist. Soc. B 49 (1987), 223-239; 252-265.
9. J. Rissanen, "Stochastic Complexity in Statistical Inquiry," World Scientific, Singapore, 1989.
10. V. V. V'yugin, Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information, Selecta Math. Soviet. 13 (1994), 357-389.
11. V. G. Vovk, Minimum description length estimators under the optimal coding scheme, in "Computational Learning Theory" (P. Vitányi, Ed.), pp. 237-251, Lecture Notes in Computer Science, Vol. 904, Springer-Verlag, Berlin, 1995.
12. K. Yamanishi, A learning criterion for stochastic rules, Mach. Learning 9(1992), 165-203.