Results on learnability and the Vapnik-Chervonenkis dimension
- 1 January 1991
- journal article
- Published by Elsevier in Information and Computation
- Vol. 90 (1) , 33-49
- https://doi.org/10.1016/0890-5401(91)90058-a
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- 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
- On finding a minimum dominating set in a tournamentTheoretical Computer Science, 1988
- Learning decision listsMachine Learning, 1987
- A theory of the learnableCommunications of the ACM, 1984
- Modeling by shortest data descriptionAutomatica, 1978
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971