Partial abductive inference in Bayesian networks by using probability trees

ICEIS 2003 - Proceedings of the 5th International Conference on Enterprise Information Systems

Volumn 2, Issue , 2003, Pages 83-91

  De Campos, Luis M ^a   Gámez, José A ^b   Moral, Serafín ^a  

^a UNIVERSITY OF GRANADA   (Spain)

^b UNIVERSITY OF CASTILLA LA MANCHA   (Spain)

Author keywords

Abductive inference; Approximate propagation; Bayesian networks; Junction join trees; Probability trees

Indexed keywords

BAYESIAN NETWORKS; COMPLEX NETWORKS; FORESTRY; INFORMATION SYSTEMS; PROBABILITY; TREES (MATHEMATICS);

ABDUCTIVE INFERENCE; CPU TIME; GRAPHICAL STRUCTURES; INFERENCE PROBLEM; JUNCTION/JOIN TREES; PROBABILITY TREES; USING PROBABILITIES;

PROBABILITY DISTRIBUTIONS;

ALGORITHMS; PROBABILITY; PROBLEM SOLVING;

EID: 84910071893     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Andersen, S., Olesen, K., Jensen, F., and Jensen, F. (1989). Hugin: A shell for buiding belief universes for expert systems. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit.
2. Beinlich, I., Suermondt, H., Chavez, R., and Cooper, G. (1989). The ALARM monitoring system: A case study with two probabilistic inference techniques for belief networks. In Proceedings of the Second European Conference on Artificial Intelligence in Medicine, pages 247-256. Springer-Verlag.
3. Boutilier, C., Friedman, N., Goldszmidt, M., and Koller, D. (1996). Context-specific independence in Bayesian networks. In Proceedings of the Twelfth Annual Conference on Uncertainty in Artificial Intelligence (UAI. 96), pages 115-123, Portland, Oregon.
4. Cano, A. and Moral, S. (1997). Propagación exacta y aproximada conárboles de probabilidad. In Actas de la VII Conferencia de la Asociacíon Espanola Para la Inteligencia Artificial, pages 635-644.
5. Cano, A., Moral, S., and Salmerón, A. (2000). Penniless propagation in join trees. International Journal of Intelligent Systems, 15:1027-1059.
6. Cooper, G. (1990). Probabilistic inference using belief networks is NP-hard. Artificial Intelligence, pages 393- 405.
7. Dawid, A. (1992). Applications of a general propagation algorithm for probabilistic expert systems. Statistics and Computing, 2:25-36.
8. de Campos, L., Gámez, J., and Moral, S. (1997). Un método exacto para realizar abducción parcial en redes Bayesianas. In Botti, V., editor, Actas de la VII Conferencia de la Asociación Espa.nola para la inteligencia artificial, pages 621-633, Málaga.
9. de Campos, L., Gámez, J., and Moral, S. (2002a). On the problem of performing exact partial abductive inference in Bayesian belief networks using junction trees. In Bouchon-Meunier, B., Gutierrez-Rios, J., Magdalena, L., and Yager, R., editors, Technologies for Constructing Intelligent Systems 2: Tools, pages 289-302. Physica-Verlag.
10. de Campos, L., Gámez, J., and Moral, S. (2002b). Partial Abductive Inference in Bayesian Belief Networks: An Evolutionary Computation Approach by Using Problem Specific Genetic Operators. IEEE Transaction on Evolutionary Computation, (6):105-131.
11. de Campos, L., Gámez, J., and Moral, S. (2002c). Partial Abductive Inference in Bayesian Belief Networks by using Simulated Annealing. International Journal of Approximate Reasoning, (27):263-283.
12. Elvira Consortium (2002). Elvira: An environment for creating and using probabilistic graphical models. In Gámez, J. and Salmerón, A., editors, Proceedings of the First European Workshop on Probabilistic Graphical Models (PGM'02), pages 222-230.
13. Jensen, F. (2001). Bayesian Networks and Decision Graphs. Springer Verlag.
14. Neapolitan, R. E. (1990). Probabilistic Reasoning in Expert Systems. Theory and Algorithms. Wiley Interscience.
15. Nilsson, D. (1994). An algorithm for finding the M most probable configurations of discrete variables that are specified in probabilistic expert systems. MSc. Thesis, University of Copenhagen.
16. Nilsson, D. (1998). An efficient algorithm for finding the M most probable configurations in Bayesian networks. Statistics and Computing, 9:159-173.
17. Park, J. (2002). Map complexity results and approximation methods. In Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI.02). Morgan Kaufmann Publishers.
18. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Mateo.
19. Quinlan, J. (1986). Induction of decision trees. Machine Learning, 1:81-106.
20. Salmerón, A., Cano, A. and Moral, S. (2000). Importance sampling in bayesian networks using probability trees. Computational Statistics and Data Analysis, 34:387-413.
21. Seroussi, B. and Goldmard, J. (1994). An algorithm directly finding the K most probable configurations in Bayesian networks. International Journal of Approximate Reasoning, 11:205-233.
22. Shimony, S. (1994). Finding maps for belief networks is NP-hard. Artificial Intelligence, 68:399-410.
23. Xu, H. (1995). Computing marginals for arbitrary subsets from marginal representation in markov trees. Artificial Intelligence, 74:177-189.