Necessary and sufficient conditions for learning with correction queries
From MaRDI portal
(Redirected from Publication:1034636)
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
Cites work
- scientific article; zbMATH DE number 1351089 (Why is no real title available?)
- scientific article; zbMATH DE number 517031 (Why is no real title available?)
- scientific article; zbMATH DE number 546592 (Why is no real title available?)
- scientific article; zbMATH DE number 3806956 (Why is no real title available?)
- A Note on the Relationship between Different Types of Correction Queries
- A general comparison of language learning from examples and from queries
- Algorithmic Learning Theory
- Algorithmic learning theory. 18th international conference, ALT 2007, Sendai, Japan, October 1--4, 2007. Proceedings
- Characterizations of monotonic and dual monotonic language learning
- Finding patterns common to a set of strings
- Formal language identification: query learning vs. gold-style learning
- Formal languages and applications.
- Grammatical Inference: Algorithms and Applications
- Grammatical inference: Algorithms and applications. 9th international colloquium, ICGI 2008, Saint-Malo, France, September 22--24, 2008. Proceedings
- Inductive inference of formal languages from positive data
- Inference of Reversible Languages
- Language identification in the limit
- Learning DFA from Correction and Equivalence Queries
- Learning Theory
- Learning context-free grammars from structural data in polynomial time
- Learning regular sets from queries and counterexamples
- Machines, Computations, and Universality
- On Learning Regular Expressions and Patterns Via Membership and Correction Queries
- One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples
- Queries and concept learning
- Relations between Gold-style learning and query learning
- 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
- Learning definite Horn formulas from closure queries
- Types of trusted information that make DFA identification with correction queries feasible
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)
