Sciweavers

447 search results - page 67 / 90
» Explaining inferences in Bayesian networks
Sort
View
FLAIRS
2006
13 years 9 months ago
Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions
A conditioning graph is a form of recursive factorization which minimizes the memory requirements and simplifies the implementation of inference in Bayesian networks. The time com...
Kevin Grant, Michael C. Horsch
ICML
2010
IEEE
13 years 8 months ago
Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds
Inference in graphical models has emerged as a promising technique for planning. A recent approach to decision-theoretic planning in relational domains uses forward inference in d...
Tobias Lang, Marc Toussaint
JMLR
2006
118views more  JMLR 2006»
13 years 7 months ago
Learning Factor Graphs in Polynomial Time and Sample Complexity
We study the computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded degree...
Pieter Abbeel, Daphne Koller, Andrew Y. Ng
JMLR
2010
202views more  JMLR 2010»
13 years 2 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
UAI
2003
13 years 9 months ago
A Simple Insight into Iterative Belief Propagation's Success
In non-ergodic belief networks the posterior belief of many queries given evidence may become zero. The paper shows that when belief propagation is applied iteratively over arbitr...
Rina Dechter, Robert Mateescu