Inductive inference theory: a unified approach to problems in pattern recognition and artificial intelligence

Authors:
R. J. Solomonoff
Affiliations:
Rockford Research Institute, Cambridge, Mass.
Venue:
IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1
Year:
1975

Citing 3
Cited 0

On the Length of Programs for Computing Finite Binary Sequences

Journal of the ACM (JACM)
Computational Complexity and Probability Constructions

Journal of the ACM (JACM)
A Theory of Program Size Formally Identical to Information Theory

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent results in induction theory are reviewed that demonstrate the general adequacy of the induction system of Solomoncff and Willis. Several problems in pattern recognition and A.I. are investigated through these methods. The theory is used to obtain the a priori probabilities that are necessary in the application cf stochastic languages to pattern recognition. A simple, quantitative solution is presented for part of Winston's problem of learning structural descriptions from exandples. In contrast to work in non-probabilistic prediction, the present methods give probability values that can be used with decision. theory to make critical decisions.