Anytime anyspace probabilistic inference

DOI10.1016/j.ijar.2004.04.001zbMath1065.68097MaRDI QIDQ1770546

Fabio Gagliardi Cozman, Fabio Tozeto Ramos

Publication date: 7 April 2005

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2004.04.001

zbMATH Keywords

Bayesian network

Mathematics Subject Classification ID

68T37: Reasoning under uncertainty in the context of artificial intelligence

Related Items

Methods for constructing balanced elimination trees and other recursive decompositions, Approximate algorithms for credal networks with binary variables

Uses Software

• AIS-BN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probability functions on complex pedigrees
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Fusion and propagation with multiple observations in belief networks
• Principles of metareasoning
• Efficient inference in Bayes networks as a combinatorial optimization problem
• Using probability trees to compute marginals with imprecise probabilities
• Probability propagation
• Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
• Importance sampling in Bayesian networks using probability trees.
• Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
• The computational complexity of probabilistic inference using Bayesian belief networks
• Local conditioning in Bayesian networks
• Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology
• Probabilistic Networks and Expert Systems
• Identifying independence in bayesian networks
• Recursive conditioning
• Principles and applications of continual computation