238 search results - page 5 / 48 » Learning Recursive Automata from Positive Examples |
ALT
2000
Springer
14 years 4 months ago
2000
Springer
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...
COGSR
2011
13 years 2 months ago
2011
We present an application of the analytical inductive programming system Igor to learning sets of recursive rules from positive experience. We propose that this approach can be us...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In the problem of learning with positive and unlabeled examples, existing research all assumes that positive examples P and the hidden positive examples in the unlabeled set U are...
ALT
2004
Springer
14 years 4 months ago
2004
Springer
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 ...
CIA
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a method to improve the positive examples selection by teaching agents in a multi-agent system in which a team of agent peers teach concepts to a learning agen...