A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques

DOI10.1016/S0888-613X(97)10004-4zbMath0941.68155MaRDI QIDQ1817998

Serafín Moral, Antonio Salmerón, Luis D. Hernández

Publication date: 27 January 2000

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

zbMATH Keywords

Monte Carlo algorithms; belief networks

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

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

Related Items

Importance sampling in Bayesian networks using probability trees., Dynamic importance sampling in Bayesian networks based on probability trees, Theoretical analysis and practical insights on importance sampling in Bayesian networks, Importance sampling algorithms for Bayesian networks: principles and performance, Lazy evaluation in penniless propagation over join trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Evidential reasoning using stochastic simulation of causal models
• Importance sampling algorithms for the propagation of probabilities in belief networks
• A modified simulation scheme for inference in Bayesian networks
• Probability propagation
• Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
• The computational complexity of probabilistic inference using Bayesian belief networks
• Probabilistic Inference and Influence Diagrams
• An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic