Learning nested differences of intersection-closed concept classes
- 1 June 1990
- journal article
- Published by Springer Nature in Machine Learning
- Vol. 5 (2) , 165-196
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On the necessity of Occam algorithms1990
- 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
- From On-line to Batch Learning1989
- LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSES1989
- Predicting (0, 1)-functions on randomly drawn points1988
- ɛ-nets and simplex range queriesDiscrete & Computational Geometry, 1987
- On learning Boolean functions1987
- On the learnability of Boolean formulae1987
- ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELSInternational Journal of General Systems, 1978