Sciweavers

Share
9 search results - page 1 / 2
» The Necessity of Bounded Treewidth for Efficient Inference i...
Sort
View
ECAI
2010
Springer
11 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 ...
AAAI
2006
11 years 8 months ago
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
Jinbo Huang, Mark Chavira, Adnan Darwiche
NIPS
2008
11 years 8 months ago
Learning Bounded Treewidth Bayesian Networks
With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while at the ...
Gal Elidan, Stephen Gould
UAI
2008
11 years 8 months ago
Efficient Inference in Persistent Dynamic Bayesian Networks
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
Tomás Singliar, Denver Dash
UAI
2008
11 years 8 months ago
Learning Arithmetic Circuits
Graphical models are usually learned without regard to the cost of doing inference with them. As a result, even if a good model is learned, it may perform poorly at prediction, be...
Daniel Lowd, Pedro Domingos
books