Learning nested differences of intersection-closed concept classes

This publication has 16 references indexed in Scilit:

• On the necessity of Occam algorithms
  Published by Association for Computing Machinery (ACM) ,1990
• Learnability and the Vapnik-Chervonenkis dimension
  Journal of the ACM, 1989
• A general lower bound on the number of examples needed for learning
  Information and Computation, 1989
• From On-line to Batch Learning
  Published by Elsevier ,1989
• LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSES
  Published by Elsevier ,1989
• Predicting (0, 1)-functions on randomly drawn points
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• ɛ-nets and simplex range queries
  Discrete & Computational Geometry, 1987
• On learning Boolean functions
  Published by Association for Computing Machinery (ACM) ,1987
• On the learnability of Boolean formulae
  Published by Association for Computing Machinery (ACM) ,1987
• ON THE CONNECTION BETWEEN THE COMPLEXITY AND CREDIBILITY OF INFERRED MODELS
  International Journal of General Systems, 1978