238 search results - page 1 / 48 » Learning Recursive Automata from Positive Examples |
RIA
2006
13 years 4 months ago
2006
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
ALT
2006
Springer
14 years 1 months ago
2006
Springer
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 ...
ECML
1998
Springer
13 years 8 months ago
1998
Springer
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
ECML
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We study the problem of learning from positive and unlabeled examples. Although several techniques exist for dealing with this problem, they all assume that positive exam...
ALMOB
2008
13 years 4 months ago
2008
Background: The application of machine learning to classification problems that depend only on positive examples is gaining attention in the computational biology community. We an...