Necessary and sufficient conditions for learning with correction queries
From MaRDI portal
Publication:1034636
DOI10.1016/J.TCS.2009.09.004zbMATH Open1194.68197OpenAlexW1990396064MaRDI QIDQ1034636FDOQ1034636
Authors: Cristina Tîrnăucă, Satoshi Kobayashi 
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.004
Recommendations
- Correction queries in active learning
- A Characterization of the Language Classes Learnable with Correction Queries
- Learning via finitely many queries
- Oracles and queries that are sufficient for exact learning
- On learning from queries and counterexamples in the presence of noise
- New Computational Paradigms
- Learning via queries in [+, <]
- Learning DFA from Correction and Equivalence Queries
- Learnability of solutions to conjunctive queries
- Learning via queries and oracles
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Cites Work
- Learning regular sets from queries and counterexamples
- Queries and concept learning
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Finding patterns common to a set of strings
- Inference of Reversible Languages
- Title not available (Why is that?)
- Learning context-free grammars from structural data in polynomial time
- Characterizations of monotonic and dual monotonic language learning
- Title not available (Why is that?)
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- Formal language identification: query learning vs. gold-style learning
- Relations between Gold-style learning and query learning
- Grammatical Inference: Algorithms and Applications
- A Note on the Relationship between Different Types of Correction Queries
- Learning DFA from Correction and Equivalence Queries
- A general comparison of language learning from examples and from queries
- Algorithmic Learning Theory
- Formal languages and applications.
- Algorithmic learning theory. 18th international conference, ALT 2007, Sendai, Japan, October 1--4, 2007. Proceedings
- Learning Theory
- Grammatical inference: Algorithms and applications. 9th international colloquium, ICGI 2008, Saint-Malo, France, September 22--24, 2008. Proceedings
- One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Machines, Computations, and Universality
- Theory and Applications of Models of Computation
Cited In (8)
- Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
- Learning correction grammars
- A Characterization of the Language Classes Learnable with Correction Queries
- Learning Correction Grammars
- A Note on the Relationship between Different Types of Correction Queries
- Correction queries in active learning
- Types of trusted information that make DFA identification with correction queries feasible
- Learning definite Horn formulas from closure queries
This page was built for publication: Necessary and sufficient conditions for learning with correction queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034636)
