A new abstract combinatorial dimension for exact learning via queries

DOI10.1006/jcss.2001.1794zbMath1006.68109OpenAlexW2012548282MaRDI QIDQ1604216

David Guijarro, José L. Balcázar, Jorge E. Castro

Publication date: 4 July 2002

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.2001.1794

zbMATH Keywords

polynomial-query learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

A general dimension for query learning ⋮ Queries revisited. ⋮ The complexity of learning concept classes with polynomial general dimension

Cites Work

• Unnamed Item
• Unnamed Item
• Learning nearly monotone \(k\)-term DNF
• Exact learning via teaching assistants
• Exact learning when irrelevant variables abound
• On the complexity of teaching
• On the learnability of disjunctive normal form formulas
• Oracles and queries that are sufficient for exact learning
• Queries and concept learning
• Learnability and the Vapnik-Chervonenkis dimension
• The complexity of exactly learning algebraic concepts
• A framework for polynomial-time query learnability
• How many queries are needed to learn?