The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks

DOI10.3233/978-1-60750-606-5-237zbMath1211.68275OpenAlexW1554371395MaRDI QIDQ2999142

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

Mathematics Subject Classification ID

Bayesian inference (62F15) Graph theory (including graph drawing) in computer science (68R10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (11)

Efficient learning of Bayesian networks with bounded tree-width ⋮ Learning Bounded Tree-Width Bayesian Networks via Sampling ⋮ Computational social choice for coordination in agent networks ⋮ 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 ⋮ Tractable inference in credal sentential decision diagrams ⋮ The complexity of Bayesian networks specified by propositional and relational languages ⋮ Approximate inference in Bayesian networks: parameterized complexity results ⋮ Unnamed Item ⋮ Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets ⋮ Computing the execution probability of jobs with replication in mixed-criticality schedules

This page was built for publication: The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks