Sample compression, learnability, and the Vapnik-Chervonenkis dimension
- 1 December 1995
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 21 (3) , 269-304
- https://doi.org/10.1007/bf00993593
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Boosting a Weak Learning Algorithm by MajorityInformation and Computation, 1995
- On Weak LearningJournal of Computer and System Sciences, 1995
- How to use expert advicePublished by Association for Computing Machinery (ACM) ,1993
- RANDOMIZED GEOMETRIC ALGORITHMSParallel Algorithms, 1992
- Learning Integer LatticesSIAM Journal on Computing, 1992
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- SPACE-BOUNDED LEARNING AND THE VAPNIK-CHERVONENKIS DIMENSIONPublished by Elsevier ,1989
- Learning faster than promised by the Vapnik-Chervonenkis dimensionDiscrete Applied Mathematics, 1989
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- Occam's RazorInformation Processing Letters, 1987