The necessity of bounded treewidth for efficient inference in Bayesian networks
DOI10.3233/978-1-60750-606-5-237zbMATH Open1211.68275OpenAlexW1554371395MaRDI QIDQ2999142FDOQ2999142
Authors: Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag 
Publication date: 11 May 2011
Full work available at URL: http://repository.ubn.ru.nl/bitstream/handle/2066/83932/83932.pdf
Recommendations
Bayesian inference (62F15) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10)
Cited In (14)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- A sufficiently fast algorithm for finding close to optimal clique trees
- Computational social choice for coordination in agent networks
- Learning Bounded Tree-Width Bayesian Networks via Sampling
- Efficient learning of Bayesian networks with bounded tree-width
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
- Fast local search methods for solving limited memory influence diagrams
- Approximate inference in Bayesian networks: parameterized complexity results
- Computing the execution probability of jobs with replication in mixed-criticality schedules
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- The complexity of Bayesian networks specified by propositional and relational languages
- Tractable inference in credal sentential decision diagrams
This page was built for publication: The necessity of bounded treewidth for efficient inference in Bayesian networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2999142)
