Sciweavers

564 search results - page 18 / 113
» Approximation algorithms for restricted Bayesian network str...
Sort
View
JMLR
2010
140views more  JMLR 2010»
14 years 7 months ago
Learning Non-Stationary Dynamic Bayesian Networks
Learning dynamic Bayesian network structures provides a principled mechanism for identifying conditional dependencies in time-series data. An important assumption of traditional D...
Joshua W. Robinson, Alexander J. Hartemink
117
Voted
ICML
2009
IEEE
16 years 1 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
109
Voted
NIPS
2003
15 years 1 months ago
Approximate Expectation Maximization
We discuss the integration of the expectation-maximization (EM) algorithm for maximum likelihood learning of Bayesian networks with belief propagation algorithms for approximate i...
Tom Heskes, Onno Zoeter, Wim Wiegerinck
94
Voted
IJCAI
2001
15 years 1 months ago
Active Learning for Structure in Bayesian Networks
The task of causal structure discovery from empirical data is a fundamental problem in many areas. Experimental data is crucial for accomplishing this task. However, experiments a...
Simon Tong, Daphne Koller
JAIR
2011
129views more  JAIR 2011»
14 years 7 months ago
Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference
Previous studies have demonstrated that encoding a Bayesian network into a SAT formula and then performing weighted model counting using a backtracking search algorithm can be an ...
Wei Li 0002, Pascal Poupart, Peter van Beek