Sciweavers

86 search results - page 2 / 18
» Conditioning Graphs: Practical Structures for Inference in B...
Sort
View
ECAI
2010
Springer
13 years 6 months ago
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
Abstract. Algorithms for probabilistic inference in Bayesian networks are known to have running times that are worst-case exponential in the size of the network. For networks with ...
Johan Kwisthout, Hans L. Bodlaender, Linda C. van ...
AI
2010
Springer
13 years 5 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
IJCAI
1997
13 years 7 months ago
Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference
Bayesian belief networks have grown to prominence because they provide compact representations of many domains, and there are algorithms to exploit this compactness. The next step...
David Poole
JAIR
2011
129views more  JAIR 2011»
13 years 22 days 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
JMLR
2010
134views more  JMLR 2010»
13 years 16 days ago
Inference of Graphical Causal Models: Representing the Meaningful Information of Probability Distributions
This paper studies the feasibility and interpretation of learning the causal structure from observational data with the principles behind the Kolmogorov Minimal Sufficient Statist...
Jan Lemeire, Kris Steenhaut