Automatic learning from positive data and negative counterexamples
From MaRDI portal
Publication:2013555
Recommendations
- Automatic learning from positive data and negative counterexamples
- Learning from Positive Data and Negative Counterexamples: A Survey
- Algorithmic Learning Theory
- Learning languages from positive data and negative counterexamples
- Learning languages from positive data and a limited number of short counterexamples
Cites work
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 3539202 (Why is no real title available?)
- scientific article; zbMATH DE number 408771 (Why is no real title available?)
- scientific article; zbMATH DE number 517033 (Why is no real title available?)
- scientific article; zbMATH DE number 1948150 (Why is no real title available?)
- scientific article; zbMATH DE number 2085171 (Why is no real title available?)
- scientific article; zbMATH DE number 806750 (Why is no real title available?)
- A machine discovery from amino acid sequences by decision trees over regular patterns
- A theory of formal synthesis via inductive learning
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- Automatic functions, linear time and learning
- Automatic learning from positive data and negative counterexamples
- Characteristics of minimal effective programming systems
- Closed choice and a uniform low basis theorem
- Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
- Distributional learning of parallel multiple context-free grammars
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Finding patterns common to a set of strings
- Independence Results for n-Ary Recursion Theorems
- Inductive inference of formal languages from positive data
- Iterative learning from positive data and negative counterexamples
- Language identification in the limit
- Language learning from texts: Mindchanges, limited memory and monotonicity
- Learnability of automatic classes
- Learning elementary formal systems
- Learning erasing pattern languages with queries
- Learning languages from positive data and negative counterexamples
- Learning recursive languages from good examples
- Learning regular languages from counterexamples
- Learning via queries in [+, <]
- Monotonic and non-monotonic inductive inference
- On automatic families
- On the impact of forgetting on learning machines
- Polynomial inference of universal automata from membership and equivalence queries
- Probabilistic computability and choice
- Queries and concept learning
- Relations between Gold-style learning and query learning
- Rich classes inferable from positive data: Length-bounded elementary formal systems
- Toward a mathematical theory of inductive inference
- Towards General Algorithms for Grammatical Inference
Cited in
(7)- Learning from Positive Data and Negative Counterexamples: A Survey
- Parallel learning of automatic classes of languages
- One-shot learners using negative counterexamples and nearest positive examples
- Learners based on transducers
- Iterative Learning from Positive Data and Counters
- Iterative learning from positive data and negative counterexamples
- Automatic learning from positive data and negative counterexamples
This page was built for publication: Automatic learning from positive data and negative counterexamples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013555)
