Importance sampling algorithms for Bayesian networks: principles and performance
DOI10.1016/j.mcm.2005.05.020zbMath1459.62021OpenAlexW2133722387MaRDI QIDQ2473194
Marek J. Druzdzel, Changhe Yuan
Publication date: 26 February 2008
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2005.05.020
Computational methods for problems pertaining to statistics (62-08) Bayesian inference (62F15) Sampling theory, sample surveys (62D05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Neural nets and related approaches to inference from stochastic processes (62M45)
Related Items (9)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Fusion and propagation with multiple observations in belief networks
- Importance sampling in Bayesian networks using probability trees.
- A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
- The computational complexity of probabilistic inference using Bayesian belief networks
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Bayesian Inference in Econometric Models Using Monte Carlo Integration
This page was built for publication: Importance sampling algorithms for Bayesian networks: principles and performance