One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples

DOI10.1007/978-3-540-75225-7_22zbMath1142.68393OpenAlexW2176619189MaRDI QIDQ3520064

Sanjay Jain, E. B. Kinber

Publication date: 19 August 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75225-7_22

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (3)

A Note on the Relationship between Different Types of Correction Queries ⋮ One-shot learners using negative counterexamples and nearest positive examples ⋮ Necessary and sufficient conditions for learning with correction queries

Cites Work

• Unnamed Item
• One-shot learners using negative counterexamples and nearest positive examples
• Formal language identification: query learning vs. gold-style learning
• Iterative learning from positive data and negative counterexamples
• Relations between Gold-style learning and query learning
• Learning DFA from Correction and Equivalence Queries
• Inductive inference of formal languages from positive data
• Learning via queries
• Algorithmic Learning Theory
• Language identification in the limit

This page was built for publication: One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples