9 search results - page 1 / 2 » The Necessity of Bounded Treewidth for Efficient Inference i... |
ECAI
2010
Springer
13 years 5 months ago
2010
Springer
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 ...
AAAI
2006
13 years 6 months ago
2006
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...
NIPS
2008
13 years 6 months ago
2008
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 ...
UAI
2008
13 years 6 months ago
2008
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...
UAI
2008
13 years 6 months ago
2008
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...