Dynamic importance sampling in Bayesian networks based on probability trees

International Journal of Approximate Reasoning

Volumn 38, Issue 3, 2005, Pages 245-261

  Moral, Serafín ^a   Salmerón, Antonio ^b  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSITY OF ALMERÍA   (Spain)

Author keywords

Approximate algorithms; Bayesian networks; Importance sampling; Probability propagation; Probability trees

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MONTE CARLO METHODS; PROBABILITY; SAMPLING;

APPROXIMATE ALGORITHMS; BAYESIAN NETWORKS; IMPORTANCE SAMPLING; PROBABILITY PROPAGATION; PROBABILITY TREES;

TREES (MATHEMATICS);

EID: 10844241941     PISSN: 0888613X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijar.2004.05.005     Document Type: Conference Paper

References (23)

1. R.R. Bouckaert, E. Castillo, J.M. Gutiérrez, A modified simulation scheme for inference in Bayesian networks, International Journal of Approximate Reasoning 14 (1996) 55-80.
2. A. Cano, S. Moral, Propagacín exacta y aproximada con árboles de probabilidad, in: Actas de la VII Conferencia de la Asociación Española para la Inteligencia Artificial, 1997, pp. 635-644.
3. A. Cano, S. Moral, A. Salmerón, Penniless propagation in join trees, International Journal of Intelligent Systems 15 (2000) 1027-1059.
4. A. Cano, S. Moral, A. Salmerón, Lazy evaluation in penniless propagation over join trees, Networks 39 (2002) 175-185.
5. A. Cano, S. Moral, A. Salmerón, Novel strategies to approximate probability trees in penniless propagation, International Journal of Intelligent Systems 18 (2003) 193-203.
6. J. Cheng, M.J. Druzdzel, AIS-BN: an adaptive importance sampling algorithm for evidential reasoning in large Bayesian networks, Journal of Artificial Intelligence Research 13 (2000) 155-188.
7. P. Dagum, M. Luby, Approximating probabilistic inference in Bayesian belief networks is NP-hard, Artificial Intelligence 60 (1993) 141-153.
8. P. Dagum, M. Luby, An optimal approximation algorithm for Bayesian inference, Artificial Intelligence 93 (1997) 1-27.
9. Elvira Consortium. Elvira: an environment for creating and using probabilistic graphical models, in: J.A. Gáez and A. Salmeró (Eds.), Proceedings of the First European Workshop on Probabilistic Graphical Models, 2002, pp. 222-230.
10. R. Fung, K.C. Chang, Weighting and integrating evidence for stochastic simulation in Bayesian networks, in: M. Henrion, R.D. Shachter, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, vol. 5, North-Holland, Amsterdam, 1990, pp. 209-220.
11. L.D. Hernádez, S. Moral, A. Salmerón, A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques, International Journal of Approximate Reasoning 18 (1998) 53-91.
12. C.S. Jensen, A. Kong, U. Kjærulff, Blocking Gibbs sampling in very large probabilistic expert systems, International Journal of Human-Computer Studies 42 (1995) 647-666.
13. U. Kjærulff, Reduction of computational complexity in Bayesian networks through removal of weak dependencies, in: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, 1994, pp. 374-382.
14. S.L. Lauritzen, D.J. Spiegelhalter, Local computations with probabilities on graphical structures and their application to expert systems, Journal of the Royal Statistical Society, Series B, 50 (1988) 157-224.
15. J. Pearl, Evidential reasoning using stochastic simulation of causal models, Artificial Intelligence 32 (1987) 247-257.
16. D. Poole, Probabilistic conflicts in a search algorithm for estimating posterior probabilities in bayesian networks, Artificial Intelligence 88 (1996) 69-100.
17. R.Y. Rubinstein, Simulation and the Monte Carlo Method, Wiley, New York, 1981.
18. A. Salmerón, A. Cano, S. Moral, Importance sampling in Bayesian networks using probability trees, Computational Statistics and Data Analysis 34 (2000) 387-413.
19. A. Salmerón, S. Moral, Importance sampling in Bayesian networks using antithetic variables, in: S. Benferhat, P. Besnard (Eds.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Springer Verlag, Berlin, 2001, pp. 168-179.
20. E. Santos, S.E. Shimony. Belief updating by enumerating high-probability independence-based assignments, in: Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, 1994, pp. 506-513.
21. E. Santos, S.E. Shimony, E. Williams, Hybrid algorithms for approximate belief updating in Bayes nets, International Journal of Approximate Reasoning 17 (1997) 191-216.
22. R.D. Shachter, M.A. Peot, Simulation approaches to general probabilistic inference on belief networks, in: M. Henrion, R.D. Shachter, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence, vol. 5, North Holland, Amsterdam, 1990, pp. 221-231.
23. N.L. Zhang, D. Poole, Exploiting causal independence in Bayesian network inference, Journal of Artificial Intelligence Research 5 (1996) 301-328.