Sciweavers

220 search results - page 11 / 44
» Learning probabilistic decision graphs
Sort
View
ICCV
2005
IEEE
14 years 9 months ago
Probabilistic Boosting-Tree: Learning Discriminative Models for Classification, Recognition, and Clustering
In this paper, a new learning framework?probabilistic boosting-tree (PBT), is proposed for learning two-class and multi-class discriminative models. In the learning stage, the pro...
Zhuowen Tu
IJON
2010
119views more  IJON 2010»
13 years 6 months ago
Hyperparameter learning in probabilistic prototype-based models
We present two approaches to extend Robust Soft Learning Vector Quantization (RSLVQ). This algorithm for nearest prototype classification is derived from an explicit cost functio...
Petra Schneider, Michael Biehl, Barbara Hammer
ICML
1994
IEEE
13 years 11 months ago
Markov Games as a Framework for Multi-Agent Reinforcement Learning
In the Markov decision process (MDP) formalization of reinforcement learning, a single adaptive agent interacts with an environment defined by a probabilistic transition function....
Michael L. Littman
ATAL
2009
Springer
14 years 2 months ago
Solving multiagent assignment Markov decision processes
We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called“Assignmen...
Scott Proper, Prasad Tadepalli
AIPS
2008
13 years 9 months ago
Learning Relational Decision Trees for Guiding Heuristic Planning
The current evaluation functions for heuristic planning are expensive to compute. In numerous domains these functions give good guidance on the solution, so it worths the computat...
Tomás de la Rosa, Sergio Jiménez, Da...