Dynamic importance sampling in Bayesian networks based on probability trees

DOI10.1016/j.ijar.2004.05.005zbMath1095.68117OpenAlexW1989308075MaRDI QIDQ1763163

Antonio Salmerón, Serafín Moral

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.ijar.2004.05.005

zbMATH Keywords

Bayesian networksImportance samplingProbability treesApproximate algorithmsProbability propagation

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (7)

FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS ⋮ Learning recursive probability trees from probabilistic potentials ⋮ Importance Sampling on Bayesian Networks with Deterministic Causalities ⋮ Importance sampling-based estimation over AND/OR search spaces for graphical models ⋮ SampleSearch: importance sampling in presence of determinism ⋮ Scalable importance sampling estimation of Gaussian mixture posteriors in Bayesian networks ⋮ Arc refractor methods for adaptive importance sampling on large Bayesian networks under evidential reasoning

Uses Software

• AIS-BN

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
• Evidential reasoning using stochastic simulation of causal models
• A modified simulation scheme for inference in Bayesian networks
• Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
• An optimal approximation algorithm for Bayesian inference
• Importance sampling in Bayesian networks using probability trees.
• Hybrid algorithms for approximate belief updating in Bayes nets
• A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
• Lazy evaluation in penniless propagation over join trees
• Novel strategies to approximate probability trees in penniless propagation

This page was built for publication: Dynamic importance sampling in Bayesian networks based on probability trees