Sciweavers

18 search results - page 2 / 4
» Learning indexed families of recursive languages from positi...
Sort
View
ALT
2006
Springer
14 years 2 months ago
Iterative Learning from Positive Data and Negative Counterexamples
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
Sanjay Jain, Efim B. Kinber
COLT
1992
Springer
13 years 9 months ago
Language Learning from Stochastic Input
Language learning from positive data in the Gold model of inductive inference is investigated in a setting where the data can be modeled as a stochastic process. Specifically, the...
Shyam Kapur, Gianfranco Bilardi
ALT
2004
Springer
14 years 2 months ago
Learning Languages from Positive Data and Negative Counterexamples
In this paper we introduce a paradigm for learning in the limit of potentially infinite languages from all positive data and negative counterexamples provided in response to the ...
Sanjay Jain, Efim B. Kinber
ALT
2000
Springer
14 years 2 months ago
Learning Recursive Concepts with Anomalies
This paper provides a systematic study of inductive inference of indexable concept classes in learning scenarios in which the learner is successful if its final hypothesis describ...
Gunter Grieser, Steffen Lange, Thomas Zeugmann
EUROCOLT
1999
Springer
13 years 9 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma