Sciweavers

204 search results - page 19 / 41
» Learning locally minimax optimal Bayesian networks
Sort
View
AI
1998
Springer
14 years 9 months ago
Model-Based Average Reward Reinforcement Learning
Reinforcement Learning (RL) is the study of programs that improve their performance by receiving rewards and punishments from the environment. Most RL methods optimize the discoun...
Prasad Tadepalli, DoKyeong Ok
ICCV
2005
IEEE
15 years 11 months ago
Efficient Learning of Relational Object Class Models
We present an efficient method for learning part-based object class models from unsegmented images represented as sets of salient features. A model includes parts' appearance...
Aharon Bar-Hillel, Tomer Hertz, Daphna Weinshall
AUSAI
2004
Springer
15 years 2 months ago
An ACO Algorithm for the Most Probable Explanation Problem
We describe an Ant Colony Optimization (ACO) algorithm, ANT-MPE, for the most probable explanation problem in Bayesian network inference. After tuning its parameters settings, we c...
Haipeng Guo, Prashanth R. Boddhireddy, William H. ...
JMLR
2010
140views more  JMLR 2010»
14 years 4 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
ICANNGA
2009
Springer
145views Algorithms» more  ICANNGA 2009»
15 years 4 months ago
Supporting Scalable Bayesian Networks Using Configurable Discretizer Actuators
We propose a generalized model with configurable discretizer actuators as a solution to the problem of the discretization of massive numerical datasets. Our solution is based on a ...
Isaac Olusegun Osunmakinde, Antoine B. Bagula