A learning criterion for stochastic rules
- 1 July 1992
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 9 (2-3) , 165-203
- https://doi.org/10.1007/bf00992676
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Efficient distribution-free learning of probabilistic conceptsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Minimum complexity density estimationIEEE Transactions on Information Theory, 1991
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- A general lower bound on the number of examples needed for learningInformation and Computation, 1989
- Inferring decision trees using the minimum description lenght principleInformation and Computation, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Learning in the presence of malicious errorsPublished by Association for Computing Machinery (ACM) ,1988
- Occam's RazorInformation Processing Letters, 1987
- A new look at the statistical model identificationIEEE Transactions on Automatic Control, 1974
- A lower bound for discrimination information in terms of variation (Corresp.)IEEE Transactions on Information Theory, 1967