238 search results - page 6 / 48 » Learning Recursive Automata from Positive Examples |
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Many real-world classification applications fall into the class of positive and unlabeled (PU) learning problems. In many such applications, not only could the negative training ex...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Face detection systems have recently achieved high detection rates[11, 8, 5] and real-time performance[11]. However, these methods usually rely on a huge training database (around...
ICGI
1998
Springer
13 years 11 months ago
1998
Springer
We present in this paper a new learning problem called learning distributions from experts. In the case we study the experts are stochastic deterministic finite automata (sdfa). W...
BMCBI
2010
13 years 7 months ago
2010
Background: Recently, supervised learning methods have been exploited to reconstruct gene regulatory networks from gene expression data. The reconstruction of a network is modeled...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...