Importance sampling in Bayesian networks using probability trees.

DOI10.1016/S0167-9473(99)00110-3zbMath1053.65006OpenAlexW2083719729WikidataQ57551207 ScholiaQ57551207MaRDI QIDQ1583491

Antonio Salmerón, Andrés Cano, Serafín 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

Bayesian networkssimulationimportance samplingMonte-Carlo algorithmprobability treesapproximate pre-computation

Mathematics Subject Classification ID

Monte Carlo methods (65C05)

Related Items (23)

New strategies for finding multiplicative decompositions of probability trees ⋮ FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS ⋮ Learning recursive probability trees from probabilistic potentials ⋮ Using probability trees to compute marginals with imprecise probabilities ⋮ Estimating mixtures of truncated exponentials in hybrid Bayesian networks ⋮ Approximate inference in Bayesian networks using binary probability trees ⋮ Two issues in using mixtures of polynomials for inference in hybrid Bayesian networks ⋮ Direct causal structure extraction from pairwise interaction patterns in NAT modeling Bayesian networks ⋮ Importance Sampling on Bayesian Networks with Deterministic Causalities ⋮ Use of Explanation Trees to Describe the State Space of a Probabilistic-Based Abduction Problem ⋮ Importance sampling algorithms for Bayesian networks: principles and performance ⋮ Dynamic importance sampling in Bayesian networks based on probability trees ⋮ Anytime anyspace probabilistic inference ⋮ Learning hybrid Bayesian networks using mixtures of truncated exponentials ⋮ Novel strategies to approximate probability trees in penniless propagation ⋮ Discovery of statistical equivalence classes using computer algebra ⋮ Arc refractor methods for adaptive importance sampling on large Bayesian networks under evidential reasoning ⋮ Causal analysis with chain event graphs ⋮ Causal discovery through MAP selection of stratified chain event graphs ⋮ Approximate probability propagation with mixtures of truncated exponentials ⋮ Computing probability intervals with simulated annealing and probability trees ⋮ Binary Probability Trees for Bayesian Networks Inference ⋮ Lazy evaluation in penniless propagation over join trees

Cites Work

• 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
• An optimal approximation algorithm for Bayesian inference
• 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
• An Accurate Approximation to the Sampling Distribution of the Studentized Extreme Value Statistic
• Bayesian Inference in Econometric Models Using Monte Carlo Integration
• On Information and Sufficiency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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