Understanding the scalability of Bayesian network inference using clique tree growth curves
From MaRDI portal
Recommendations
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- scientific article; zbMATH DE number 1735825
- Binary Probability Trees for Bayesian Networks Inference
- Independence of causal influence and clique tree propagation
- A sufficiently fast algorithm for finding close to optimal clique trees
Cites work
- scientific article; zbMATH DE number 4174342 (Why is no real title available?)
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 1288300 (Why is no real title available?)
- scientific article; zbMATH DE number 496106 (Why is no real title available?)
- scientific article; zbMATH DE number 1149408 (Why is no real title available?)
- scientific article; zbMATH DE number 2014740 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (Why is no real title available?)
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- A differential approach to inference in Bayesian networks
- A differential semantics for jointree algorithms
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- Approximating MAPs for belief networks is NP-hard and other theorems
- Bucket elimination: A unifying framework for reasoning
- Complexity of Finding Embeddings in a k-Tree
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Factor graphs and the sum-product algorithm
- Finding MAPs for belief networks is NP-hard
- MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
- Network-based heuristics for constraint-satisfaction problems
- On the hardness of approximate reasoning
- Paths in graphs
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Probabilistic inference in multiply connected belief networks using loop cutsets
- Recursive conditioning
- Some nonlinear parameters of PP intervals of pulse main peaks
- Statistical analysis of stochastic processes in time.
- The computational complexity of probabilistic inference using Bayesian belief networks
- The structure and dynamics of networks
- Topological parameters for time-space tradeoff
- Tree-based reparameterization framework for analysis of sum-product and related algorithms
- Treewidth. Computations and approximations
- Treewidth: computational experiments
- Understanding the role of noise in stochastic local search: analysis and experiments
Cited in
(2)
This page was built for publication: Understanding the scalability of Bayesian network inference using clique tree growth curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q991030)
