Three Kinds of Probabilistic Induction: Universal Distributions and Convergence Theorems
暂无分享,去创建一个
[1] Ming Li,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.
[2] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part I , 1964, Inf. Control..
[3] J. Rissanen,et al. Modeling By Shortest Data Description* , 1978, Autom..
[4] Ray J. Solomonoff,et al. Complexity-based induction systems: Comparisons and convergence theorems , 1978, IEEE Trans. Inf. Theory.
[5] Marcus Hutter,et al. Optimality of Universal Bayesian Sequence Prediction for General Loss and Alphabet , 2003, J. Mach. Learn. Res..
[6] R. Solomonoff. A PRELIMINARY REPORT ON A GENERAL THEORY OF INDUCTIVE INFERENCE , 2001 .
[7] James J. Horning,et al. A Procedure for Grammatical Inference , 1971, IFIP Congress.
[8] David G. Willis,et al. Computational Complexity and Probability Constructions , 1970, JACM.
[9] Ray J. Solomonoff,et al. Two Kinds of Probabilistic Induction , 1999, Comput. J..
[10] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..
[11] C. S. Wallace,et al. Estimation and Inference by Compact Coding , 1987 .
[12] C. S. Wallace,et al. An Information Measure for Classification , 1968, Comput. J..