On the necessity of Occam algorithms
Authors:
- Raymond BoardRBRaymond Board
- Leonard PittLPLeonard Pitt
- 1 June 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 100 (1) , 157-184
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Prediction-preserving reducibilityJournal of Computer and System Sciences, 1990
- The strength of weak learnabilityMachine Learning, 1990
- Negative results for equivalence queriesMachine Learning, 1990
- Learning conjunctive concepts in structural domainsMachine Learning, 1989
- 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
- Learning decision listsMachine Learning, 1987
- Occam's RazorInformation Processing Letters, 1987
- Computational Complexity of Probabilistic Turing MachinesSIAM Journal on Computing, 1977