Iterative learning from texts and counterexamples using additional information
From MaRDI portal
Publication:415613
DOI10.1007/s10994-011-5238-7zbMath1237.68149OpenAlexW2025980818WikidataQ125055765 ScholiaQ125055765MaRDI QIDQ415613
Publication date: 8 May 2012
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-011-5238-7
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prudence and other conditions on formal language learning
- Learning indexed families of recursive languages from positive data: A survey
- Learning languages from positive data and negative counterexamples
- U-shaped, iterative, and iterative-with-counter learning
- Finding patterns common to a set of strings
- Incremental learning from positive data
- Incremental concept learning for bounded data mining.
- Queries and concept learning
- Iterative learning from positive data and negative counterexamples
- Iterative Learning from Texts and Counterexamples Using Additional Information
- Periodicity in generations of automata
- Toward a mathematical theory of inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Semirecursive Sets and Positive Reducibility
- Language identification in the limit
This page was built for publication: Iterative learning from texts and counterexamples using additional information
