Anytime anyspace probabilistic inference

DOI10.1016/J.IJAR.2004.04.001zbMATH Open1065.68097OpenAlexW2030424768MaRDI QIDQ1770546FDOQ1770546

Authors: Fabio Ramos, Fabio Gagliardi Cozman 

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

Recommendations

• Recursive conditioning
• AI 2005: Advances in Artificial Intelligence
• An optimal approximation algorithm for Bayesian inference
• scientific article; zbMATH DE number 6253970
• scientific article; zbMATH DE number 2086480

zbMATH Keywords

Bayesian network

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• AI 2005: Advances in Artificial Intelligence
• Methods for constructing balanced elimination trees and other recursive decompositions
• Relax, compensate and then recover: a theory of anytime, approximate inference
• Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications
• Topological parameters for time-space tradeoff
• An extended depth-first search algorithm for optimal triangulation of Bayesian networks
• All roads lead to Rome -- new search methods for the optimal triangulation problem
• Scalable importance sampling estimation of Gaussian mixture posteriors in Bayesian networks
• Active tuples-based scheme for bounding posterior beliefs
• Title not available (Why is that?)
• Recursive conditioning
• Approximate algorithms for credal networks with binary variables

Uses Software

• AIS-BN

This page was built for publication: Anytime anyspace probabilistic inference

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1770546)