One-shot learners using negative counterexamples and nearest positive examples

DOI10.1016/j.tcs.2009.02.013zbMath1172.68027OpenAlexW2098630092WikidataQ124839690 ScholiaQ124839690MaRDI QIDQ1029327

Sanjay Jain, E. B. Kinber

Publication date: 10 July 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.02.013

zbMATH Keywords

counterexampleinductive inferencenearest positive example

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples

Cites Work

• Unnamed Item
• Unnamed Item
• Learning indexed families of recursive languages from positive data: A survey
• Learning languages from positive data and negative counterexamples
• Inferring answers to queries
• On the structure of degrees of inferability.
• Extremes in the degrees of inferability
• Queries and concept learning
• Formal language identification: query learning vs. gold-style learning
• Iterative learning from positive data and negative counterexamples
• A general comparison of language learning from examples and from queries
• Relations between Gold-style learning and query learning
• One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
• Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
• Learning DFA from Correction and Equivalence Queries
• Inductive inference of formal languages from positive data
• Learning via queries in [+, <]
• Learning via queries
• A Characterization of the Language Classes Learnable with Correction Queries
• Language identification in the limit

This page was built for publication: One-shot learners using negative counterexamples and nearest positive examples