224 search results - page 23 / 45 » Bounding Learning Time in XCS |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
AIMSA
2008
Springer
14 years 2 months ago
2008
Springer
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for c...
IJCAI
1993
13 years 9 months ago
1993
This paper introduces a new concept, a decision tree (or list) over tree patterns, which is a natural extension of a decision tree (or decision list), for dealing with tree struct...
FLAIRS
2003
13 years 9 months ago
2003
1 Reinforcement learning has become a widely used methodology for creating intelligent agents in a wide range of applications. However, its performance deteriorates in tasks with s...
ALT
1995
Springer
14 years 16 hour ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...