On learning from queries and counterexamples in the presence of noise
From MaRDI portal
Publication:751304
DOI10.1016/0020-0190(91)90220-CzbMath0714.68062OpenAlexW2083117818WikidataQ124989026 ScholiaQ124989026MaRDI QIDQ751304
Publication date: 1991
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(91)90220-c
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
Efficient multiple constraint acquisition ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Learning fallible deterministic finite automata ⋮ Recent advances of grammatical inference ⋮ Grammatical inference: An old and new paradigm ⋮ Learning attribute-efficiently with corrupt oracles ⋮ Learning with unreliable boundary queries ⋮ Improved lower bounds for learning from noisy examples: An information-theoretic approach
Cites Work