One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples

DOI10.1007/978-3-540-75225-7_22MaRDI QIDQ3520064zbMATH OpenOpenAlexFDO

Authors Sanjay Jain, Efim 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

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

Recommendations

• One-shot learners using negative counterexamples and nearest positive examples
• Learning languages from positive data and a limited number of short counterexamples
• Learning languages from positive data and negative counterexamples
• Algorithmic Learning Theory
• On Learning Languages from Positive Data and a Limited Number of Short Counterexamples

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Algorithmic Learning Theory
• Formal language identification: query learning vs. gold-style learning
• Inductive inference of formal languages from positive data
• Iterative learning from positive data and negative counterexamples
• Language identification in the limit
• Learning DFA from Correction and Equivalence Queries
• Learning via queries
• One-shot learners using negative counterexamples and nearest positive examples
• Relations between Gold-style learning and query learning

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3520064)