A randomized approximation algorithm for probabilistic inference on bayesian belief networks

DOI10.1002/NET.3230200510zbMATH Open0719.68078OpenAlexW2159082327MaRDI QIDQ5751997FDOQ5751997

R. Martin Chavez, Gregory F. Cooper

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200510

Recommendations

• Publication:5753551
• The computational complexity of probabilistic inference using Bayesian belief networks
• An optimal approximation algorithm for Bayesian inference
• A Bayesian analysis of simulation algorithms for inference in belief networks
• Modeling and Reasoning with Bayesian Networks

zbMATH Keywords

probabilistic inferenceBayesian belief networksprobabilistic expert systems

Mathematics Subject Classification ID

Bayesian inference (62F15) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Cites Work

• Title not available (Why is that?)

Cited In (20)

• The computational complexity of probabilistic inference using Bayesian belief networks
• Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
• Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
• Arc refractor methods for adaptive importance sampling on large Bayesian networks under evidential reasoning
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• An optimal approximation algorithm for Bayesian inference
• Tail uncertainty analysis in complex systems
• Efficient inference in Bayes networks as a combinatorial optimization problem
• Integrated decision-support system for diagnosis, maintenance planning, and scheduling of manufacturing systems
• Propagating imprecise probabilities in Bayesian networks
• Approximating MAPs for belief networks is NP-hard and other theorems
• A generic framework for a compilation-based inference in probabilistic and possibilistic networks
• Join tree propagation with prioritized messages
• Title not available (Why is that?)
• Independence of causal influence and clique tree propagation
• Improving the mean-field approximation in belief networks using Bahadur's reparameterisation of the multivariate binary distribution
• Fusion and propagation with multiple observations in belief networks
• Network reliability: Heading out on the highway
• Estimating extreme probabilities using tail simulated data
• Approximate algorithms for credal networks with binary variables

This page was built for publication: A randomized approximation algorithm for probabilistic inference on bayesian belief networks

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