Importance sampling in Bayesian networks using probability trees.

DOI10.1016/S0167-9473(99)00110-3MaRDI QIDQ1583491zbMATH OpenOpenAlexWikidataFDO

Authors Antonio Salmerón, Andrés Cano, Serafin Moral

Publication date 26 October 2000

Published in Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-9473(99)00110-3

zbMATH Keywords

simulationBayesian networksimportance samplingprobability treesMonte-Carlo algorithmapproximate pre-computation

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Recommendations

• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
• Dynamic importance sampling in Bayesian networks based on probability trees
• Importance sampling algorithms for the propagation of probabilities in belief networks
• Mixing exact and importance sampling propagation algorithms in dependence graphs
• Dynamic importance sampling computation in Bayesian networks

Cites work

• scientific article; zbMATH DE number 3841285 (Why is no real title available?)
• scientific article; zbMATH DE number 4060768 (Why is no real title available?)
• scientific article; zbMATH DE number 4060777 (Why is no real title available?)
• scientific article; zbMATH DE number 1149408 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• scientific article; zbMATH DE number 4189220 (Why is no real title available?)
• scientific article; zbMATH DE number 4189232 (Why is no real title available?)
• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
• An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic
• An optimal approximation algorithm for Bayesian inference
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Bayesian Inference in Econometric Models Using Monte Carlo Integration
• Evidential reasoning using stochastic simulation of causal models
• Importance sampling algorithms for the propagation of probabilities in belief networks
• On Information and Sufficiency
• The computational complexity of probabilistic inference using Bayesian belief networks

Cited in

(28)

• Novel strategies to approximate probability trees in penniless propagation
• scientific article; zbMATH DE number 1844470 (Why is no real title available?)
• Dynamic importance sampling computation in Bayesian networks
• New strategies for finding multiplicative decompositions of probability trees
• Computing probability intervals with simulated annealing and probability trees
• Direct causal structure extraction from pairwise interaction patterns in NAT modeling Bayesian networks
• Anytime anyspace probabilistic inference
• Arc refractor methods for adaptive importance sampling on large Bayesian networks under evidential reasoning
• Use of explanation trees to describe the state space of a probabilistic-based abduction problem
• Importance sampling for maxima on trees
• Learning hybrid Bayesian networks using mixtures of truncated exponentials
• Causal discovery through MAP selection of stratified chain event graphs
• Importance Sampling on Bayesian Networks with Deterministic Causalities
• Dynamic importance sampling in Bayesian networks based on probability trees
• Approximate inference in Bayesian networks using binary probability trees
• Discovery of statistical equivalence classes using computer algebra
• Importance sampling algorithms for Bayesian networks: principles and performance
• Using probability trees to compute marginals with imprecise probabilities
• Learning recursive probability trees from probabilistic potentials
• Theoretical analysis and practical insights on importance sampling in Bayesian networks
• Binary Probability Trees for Bayesian Networks Inference
• Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
• Lazy evaluation in penniless propagation over join trees
• Two issues in using mixtures of polynomials for inference in hybrid Bayesian networks
• Estimating mixtures of truncated exponentials in hybrid Bayesian networks
• scientific article; zbMATH DE number 4060768 (Why is no real title available?)
• Causal analysis with chain event graphs
• Approximate probability propagation with mixtures of truncated exponentials

This page was built for publication: Importance sampling in Bayesian networks using probability trees.

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