Sciweavers

241 search results - page 32 / 49
» Learning Classes of Probabilistic Automata
Sort
View
ALT
2006
Springer
14 years 4 months ago
Asymptotic Learnability of Reinforcement Problems with Arbitrary Dependence
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
Daniil Ryabko, Marcus Hutter
ECML
2007
Springer
14 years 1 months ago
Learning to Classify Documents with Only a Small Positive Training Set
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...
Xiaoli Li, Bing Liu, See-Kiong Ng

Publication
252views
13 years 10 months ago
Context models on sequences of covers
We present a class of models that, via a simple construction, enables exact, incremental, non-parametric, polynomial-time, Bayesian inference of conditional measures. The approac...
Christos Dimitrakakis
INFFUS
2008
97views more  INFFUS 2008»
13 years 7 months ago
Using classifier ensembles to label spatially disjoint data
act 11 We describe an ensemble approach to learning from arbitrarily partitioned data. The partitioning comes from the distributed process12 ing requirements of a large scale simul...
Larry Shoemaker, Robert E. Banfield, Lawrence O. H...
JAIR
2008
157views more  JAIR 2008»
13 years 7 months ago
Learning to Reach Agreement in a Continuous Ultimatum Game
It is well-known that acting in an individually rational manner, according to the principles of classical game theory, may lead to sub-optimal solutions in a class of problems nam...
Steven de Jong, Simon Uyttendaele, Karl Tuyls