238 search results - page 25 / 48 » Learning Recursive Automata from Positive Examples |
134
Voted
LPKR
1997
Springer
15 years 5 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
ALT
2005
Springer
15 years 10 months ago
2005
Springer
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
132
click to vote
TJS
2010
15 years 3 days ago
2010
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
111
click to vote
COLT
2008
Springer
15 years 3 months ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
125
click to vote
ICCV
2007
IEEE
16 years 3 months ago
2007
IEEE
Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a fixed coordinate system can be examined. Cu...