Learning from Positive Data and Negative Counterexamples: A Survey

DOI10.1007/978-3-319-13350-8_24zbMath1323.68327OpenAlexW257599271MaRDI QIDQ2944899

Sanjay Jain, E. B. Kinber

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_24

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Iterative learning from texts and counterexamples using additional information
• Comparison of identification criteria for machine inductive inference
• Learning languages from positive data and negative counterexamples
• Learnability of automatic classes
• Incremental learning from positive data
• Incremental concept learning for bounded data mining.
• Language learning with some negative information
• Automatic learning from positive data and negative counterexamples
• Queries and concept learning
• Iterative learning from positive data and negative counterexamples
• Learning languages from positive data and a limited number of short counterexamples
• Learning languages from positive data and a finite number of queries
• Automatic Learning from Positive Data and Negative Counterexamples
• Learnability of Automatic Classes
• Characterization of language learning front informant under various monotonicity constraints
• Algorithmic Learning Theory
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit

This page was built for publication: Learning from Positive Data and Negative Counterexamples: A Survey