Understanding the scalability of Bayesian network inference using clique tree growth curves

DOI10.1016/j.artint.2010.05.007zbMath1205.68427OpenAlexW2164834506MaRDI QIDQ991030

Ole J. Mengshoel

Publication date: 2 September 2010

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.05.007

zbMATH Keywords

Bayesian networksregressionprobabilistic reasoningcontinuous approximation\(C/V\)-ratioclique tree clusteringclique tree growthcontrolled experimentsGompertz growth curves

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items

An extended depth-first search algorithm for optimal triangulation of Bayesian networks

Cites Work

• A differential semantics for jointree algorithms
• Probabilistic inference in multiply connected belief networks using loop cutsets
• Some nonlinear parameters of PP intervals of pulse main peaks
• Network-based heuristics for constraint-satisfaction problems
• Approximating MAPs for belief networks is NP-hard and other theorems
• Efficient inference in Bayes networks as a combinatorial optimization problem
• Finding MAPs for belief networks is NP-hard
• Treewidth. Computations and approximations
• Bucket elimination: A unifying framework for reasoning
• Understanding the role of noise in stochastic local search: analysis and experiments
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
• The computational complexity of probabilistic inference using Bayesian belief networks
• On the hardness of approximate reasoning
• Statistical Analysis of Stochastic Processes in Time
• A differential approach to inference in Bayesian networks
• MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
• Complexity of Finding Embeddings in a k-Tree
• Factor graphs and the sum-product algorithm
• Tree-based reparameterization framework for analysis of sum-product and related algorithms
• Paths in graphs
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Topological parameters for time-space tradeoff
• Recursive conditioning
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item