Importance sampling in Bayesian networks using probability trees

Computational Statistics and Data Analysis

Volumn 34, Issue 4, 2000, Pages 387-413

  Salmerón, Antonio ^a   Cano, Andrés ^b   Moral, Serafín ^b  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITY OF GRANADA   (Spain)

Author keywords

Approximate precomputation; Bayesian networks; Importance sampling; Probability trees; Simulation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; PROBABILITY DISTRIBUTIONS; SAMPLING; TREES (MATHEMATICS);

APPROXIMATE PRE-COMPUTATIONS; BAYESIAN NETWORKS;

MONTE CARLO METHODS;

BAYESIAN ANALYSIS; MONTE CARLO ANALYSIS; NETWORK ANALYSIS; PROBABILITY;

EID: 0034302667     PISSN: 01679473     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-9473(99)00110-3     Document Type: Article

References (31)

1. Context-specific independence in Bayesian networks
2. Query expansion using Bayesian networks
3. Heuristic algorithms for the triangulation of graphs
4. Propagacion exacta y aproximada con arboles de probabilidad
5. Importance sampling algorithms for the propagation of probabilities in belief networks
6. The computational complexity of probabilistic inference using Bayesian belief networks
7. Approximating probabilistic inference in Bayesian belief networks is NP-hard
8. An optimal approximation algorithm for Bayesian inference
9. Directional resolution: The Davis-Putnam procedure, revisited
10. A scheme for approximating probabilistic inference
11. An accurate approximation to the sampling distribution of the studentized extreme-valued statistic
12. Weighting and integrating evidence for stochastic simulation in Bayesian networks
13. Backward simulation in Bayesian networks
14. Bayesian inference in econometric models using Monte Carlo integration
15. Propagating uncertainty by logic sampling in Bayes' networks
16. Importance sampling algorithms for belief networks based on approximate computation
17. A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
18. Blocking gibbs sampling in very large probabilistic expert systems
19. Optimal decomposition of probabilistic networks by simulated annealing
20. Nonuniform dynamic discretization in hybrid networks
21. On information and sufficiency
22. Local computations with probabilities on graphical structures and their application to expert systems
23. Evidential reasoning using stochastic simulation of causal models
24. Exploiting contextual independence and approximation in belief network inference
25. Probabilistic partial evaluation: Exploiting rule structure in probabilistic inference
26. Induction of decision trees
27. Simulation approaches to general probabilistic inference on belief networks
28. Exploiting causal independence in Bayesian network inference