The necessity of bounded treewidth for efficient inference in Bayesian networks
From MaRDI portal
Recommendations
Cited in
(19)- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- The complexity of Bayesian networks specified by propositional and relational languages
- Approximate inference in Bayesian networks: parameterized complexity results
- Computing the execution probability of jobs with replication in mixed-criticality schedules
- Tractable inference in credal sentential decision diagrams
- Efficient learning of Bayesian networks with bounded tree-width
- Probabilistic inference and monadic second order logic
- scientific article; zbMATH DE number 5968954 (Why is no real title available?)
- Computational social choice for coordination in agent networks
- Learning bounded tree-width Bayesian networks via sampling
- scientific article; zbMATH DE number 7626718 (Why is no real title available?)
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- Inapproximability of treewidth and related problems
- A sufficiently fast algorithm for finding close to optimal clique trees
- Uncertainty reasoning for probabilistic Petri nets via Bayesian networks
- Theoretical foundations for parent divorcing transformations in Bayesian networks
- Property testing in Gaussian graphical models: trees and small separation numbers
- 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
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)
