The strength of weak learnability
- 1 June 1990
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 5 (2) , 197-227
- https://doi.org/10.1007/bf00116037
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Learning decision trees from random examplesInformation and Computation, 1989
- SPACE-BOUNDED LEARNING AND THE VAPNIK-CHERVONENKIS DIMENSIONPublished by Elsevier ,1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Occam's RazorInformation Processing Letters, 1987
- On the learnability of Boolean formulaePublished by Association for Computing Machinery (ACM) ,1987
- A theory of the learnableCommunications of the ACM, 1984
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980
- Fast probabilistic algorithms for hamiltonian circuits and matchingsJournal of Computer and System Sciences, 1979
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963