Bounding sample size with the Vapnik-Chervonenkis dimension
- 1 February 1993
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 42 (1) , 65-73
- https://doi.org/10.1016/0166-218x(93)90179-r
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Computational limitations on learning from examplesJournal of the ACM, 1988
- Quantifying inductive bias: AI learning algorithms and Valiant's learning frameworkArtificial Intelligence, 1988
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- A theory of the learnableCommunications of the ACM, 1984
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971