Sciweavers

813 search results - page 158 / 163
» Ensemble Algorithms in Reinforcement Learning
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
JCST
2010
109views more  JCST 2010»
13 years 2 months ago
The Inverse Classification Problem
In this paper, we examine an emerging variation of the classification problem, which is known as the inverse classification problem. In this problem, we determine the features to b...
Charu C. Aggarwal, Chen Chen, Jiawei Han
AGI
2011
12 years 11 months ago
Comparing Humans and AI Agents
Comparing humans and machines is one important source of information about both machine and human strengths and limitations. Most of these comparisons and competitions are performe...
Javier Insa-Cabrera, David L. Dowe, Sergio Espa&nt...
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
14 years 7 months ago
Distributed classification in peer-to-peer networks
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
Ping Luo, Hui Xiong, Kevin Lü, Zhongzhi Shi
ATAL
2008
Springer
13 years 9 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...