238 search results - page 4 / 48 » Learning Recursive Automata from Positive Examples |
KDD
2008
ACM
14 years 7 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
ALT
1998
Springer
13 years 11 months ago
1998
Springer
Learning from positive examples occurs very frequently in natural learning. The PAC learning model of Valiant takes many features of natural learning into account, but in most case...
MCU
2004
13 years 8 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
ILP
2001
Springer
13 years 12 months ago
2001
Springer
The Bayesian framework of learning from positive noise-free examples derived by Muggleton [12] is extended to learning functional hypotheses from positive examples containing norma...
MM
2005
ACM
14 years 1 months ago
2005
ACM
In this paper we unify two supposedly distinct tasks in multimedia retrieval. One task involves answering queries with a few examples. The other involves learning models for seman...