238 search results - page 3 / 48 » Learning Recursive Automata from Positive Examples |
GOSLER
1995
13 years 9 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
The problem of learning with positive and unlabeled examples arises frequently in retrieval applications. We transform the problem into a problem of learning with noise by labelin...
CI
2006
13 years 5 months ago
2006
Most research on learning to identify sentiment ignores "neutral" examples, learning only from examples of significant (positive or negative) polarity. We show that it i...
IANDC
2007
13 years 5 months ago
2007
The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requirements s...
WAIM
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The problem of classification from positive and unlabeled examples attracts much attention currently. However, when the number of unlabeled negative examples is very sma...