A New Abstract Combinatorial Dimension for Exact Learning via Queries
Authors:
- José L. BalcázarJBJosé L. Balcázar
- Jorge CastroJCJorge Castro
- David GuijarroDGDavid Guijarro
- 1 February 2002
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 64 (1) , 2-21
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Exact learning when irrelevant variables aboundInformation Processing Letters, 1999
- Learning nearly monotone k-term DNFInformation Processing Letters, 1998
- How many queries are needed to learn?Journal of the ACM, 1996
- Oracles and Queries That Are Sufficient for Exact LearningJournal of Computer and System Sciences, 1996
- On the learnability of disjunctive normal form formulasMachine Learning, 1995
- On the Complexity of TeachingJournal of Computer and System Sciences, 1995
- A framework for polynomial-time query learnabilityTheory of Computing Systems, 1994
- Negative results for equivalence queriesMachine Learning, 1990
- Learnability and the Vapnik-Chervonenkis dimensionJournal of the ACM, 1989
- Queries and concept learningMachine Learning, 1988