Evidence propagation in credal networks: An exact algorithm based on separately specified sets of probability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2507, Issue , 2002, Pages 376-385

  da Rocha, José Carlos F ^a,b   Cozman, Fabio G ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b STATE UNIVERSITY OF PONTA GROSSA   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BAYESIAN NETWORKS; PROBABILITY;

APPROXIMATE REASONING; ARTIFICIAL INTELLIGENCE RESEARCH; EVIDENCE PROPAGATION; EVIDENTIAL REASONING; INDEPENDENCE ASSUMPTION; PROBABILISTIC MODELS; SETS OF PROBABILITIES; UPPER AND LOWER PROBABILITIES;

GRAPHIC METHODS;

EID: 70349778220     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36127-8_36     Document Type: Conference Paper

References (20)

1. [1] Campos, L. M, de Moral, S.: Independence concepts for convex sets of probabilities. Proc. of the XI Conf. on Uncertainty in Artificial Intelligence, Montreal, Canada (1995) 108-115.
2. [2] Cano, J., Delgado, M., Moral, S.: An axiomatic framework for propagating uncertainty in directed acyclic networks. International Journal of Approximate Reasoning, (1993) 8:253-280.
3. [3] Cano, A., Cano, J. E., Moral, S.: Convex sets of probabilities propagation by simulated annealing. IPMU’94, Paris France (1994) 978-983.
4. [4] Cano, A., Moral, S.: A genetic algorithm to approxiamte convex sets of probabilities. IPMU’96, Vol. 2, (1999) 859-864.
5. [5] Cano, A., Moral, S.: Using probabilities trees to compute marginals with imprecise probabilities. TR-DECSAI-00-02-14, University of Granada, (2000).
6. [6] Charniak, E.: Bayesian Networks without tears. AI Magazine, Vol.12. 4 (1994) 50-63.
7. [7] Couso, I. Moral, S., Walley, P.: Examples of independence for imprecise probabilities. 1st ISIPTA, Ghent Belgium (1999).
8. [8] Cozman, F. G.: Credal networks. Artificial Intelligence (2000) 1-35.
9. [9] Cozman, F. G.: Generalizing variable elimination in Bayesian networks. Workshop on Probabilistic Reasoning in Artificial Intelligence - IBERAMIA/SBIA, Atibaia, Brazil (2000).
10. [10] Dechter, R.: Bucket elimination: A unifying framework for probabilistic inference. Proc. of the XII Conf. on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA (1996) 211-219.
11. [11] Edelsbrunner, H.: Algorithms in combinatorial geometry. Springer-Verlag (1987).
12. [12] Fagiuoli, E., Zaffalon, M.: 2U: an exact interval propagaion algorithm for polytrees with binary variables. AI, Elsevier, 106 (1998) 77-107.
13. [13] Giron, F. J., Rios, S.: Quasi-Bayesian behavior: A more realistic approach to decision making? in: Bernado, J. M., DeGroot, J.H., Lindley, J.H. Smith, A. F.M. (eds.) Bayesian Statistics, University Press, Valencia, (1980) 17-38.
14. [14] Ha, V.A. et al: Geometric foundations for interval-based probabilities. Annals of Mathematics and Artificial Intelligence, Vol.24, 1-4 (1998) 1-21.
15. [15] Jensen, F.V., Olensen K.G., Andersen, S. K.: An algebra of Bayesian belief universes for Knowledge-Based Systems. Networks, Vol. 20. (1990) 637-659.
16. [16] Neapolitan, R.E.: Probabilistic reasoning in expert systems. Theory and algorithms. John Willey and Sons, New York, (1990).
17. [17] Pearl, J.: Probabilistic reasoning in intelligent systems. Networks of Plausible Inference. Morgan Kaufmann Publishers, San Mateo CA (1988).
18. [18] Rocha, J.C. F. da Cozman F.G.: Inference with Separately Specified Sets of Probabilities in Credal Networks, Proc. of the Conf. on Uncertainty in Artificial Intelligence, Edmonton, Canada, (2002).
19. [19] Tessem, B.: Interval Probability propagation. Int. Journal of Approximated Reasonin 7, (1995) 95-120.
20. [20] Zhang, N. L., Poole, D. Explointing causal independence in Bayesian networks inference. Journal of Artificial Intelligence Research, 5 (1996) 301-328.