Sciweavers

813 search results - page 106 / 163
» Ensemble Algorithms in Reinforcement Learning
Sort
View
ATAL
2008
Springer
15 years 6 months ago
Expediting RL by using graphical structures
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
Peng Dai, Alexander L. Strehl, Judy Goldsmith
NIPS
2007
15 years 5 months ago
Regularized Boost for Semi-Supervised Learning
Semi-supervised inductive learning concerns how to learn a decision rule from a data set containing both labeled and unlabeled data. Several boosting algorithms have been extended...
Ke Chen 0001, Shihai Wang
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
15 years 10 months ago
Learning through Changes: An Empirical Study of Dynamic Behaviors of Probability Estimation Trees
In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probabil...
Kun Zhang, Zujia Xu, Jing Peng, Bill P. Buckles
IRMA
2000
15 years 5 months ago
Recognizing bounds of context change in on-line learning
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
Helen Kaikova, Vagan Y. Terziyan, Borys Omelayenko
AUSAI
2008
Springer
15 years 6 months ago
Clustering with XCS on Complex Structure Dataset
Learning Classifier System (LCS) is an effective tool to solve classification problems. Clustering with XCS (accuracy-based LCS) is a novel approach proposed recently. In this pape...
Liangdong Shi, Yang Gao, Lei Wu, Lin Shang