Theoretical analysis and practical insights on importance sampling in Bayesian networks
From MaRDI portal
Publication:2463642
DOI10.1016/j.ijar.2006.09.006zbMath1133.68456OpenAlexW2010548278MaRDI QIDQ2463642
Changhe Yuan, Marek J. Druzdzel
Publication date: 14 December 2007
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2006.09.006
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
Uses Software
Cites Work
- 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
- An introduction to MCMC for machine learning
- A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
- Importance sampling algorithms for Bayesian networks: principles and performance
- The computational complexity of probabilistic inference using Bayesian belief networks
- Dynamically Weighted Importance Sampling in Monte Carlo Computation
- Bayesian Inference in Econometric Models Using Monte Carlo Integration
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Monte Carlo strategies in scientific computing
This page was built for publication: Theoretical analysis and practical insights on importance sampling in Bayesian networks