Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
- 30 September 1988
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 36 (2) , 177-221
- https://doi.org/10.1016/0004-3702(88)90002-1
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- 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
- Computational limitations on learning from examplesJournal of the ACM, 1988
- An analytical comparison of some rule-learning programsArtificial Intelligence, 1985
- A theory of the learnableCommunications of the ACM, 1984
- Generalization as searchArtificial Intelligence, 1982
- Some special vapnik-chervonenkis classesDiscrete Mathematics, 1981
- Modeling by shortest data descriptionAutomatica, 1978
- ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELSInternational Journal of General Systems, 1978