Belief updating and learning in semi-qualitative probabilistic networks

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 153-160

  De Campos, Cassio Polpo ^a,b   Cozman, Fabio Gagliardi ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b PONTIFÍCIA UNIVERSIDADE CATÓLICA DE CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; MAXIMUM LIKELIHOOD;

BELIEF UPDATING; IMPRECISE DIRICHLET MODEL; MAXIMUM LIKELIHOOD METHODS; MULTI-LINEAR PROGRAMMING; QUALITATIVE INFORMATION; QUALITATIVE PROBABILISTIC NETWORKS; QUALITATIVE RELATION; SET VALUED ESTIMATES;

PROBABILISTIC LOGICS;

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

References (44)

1. K. A. Andersen and J. N. Hooker. Bayesian logic. Decision Support Systems, 11:191.210, 1994.
2. J. O. Berger. Statistical Decision Theory and Bayesian Analysis. Springer-Verlag, 1985.
3. J.-M. Bernard. Implicative analysis for multivariate binary data using an imprecise Dirichlet model. J. of Statistical Planning and Inference, 105:83-103, 2002.
4. J. H. Bolt, S. Renooij, and L. C. van der Gaag. Upgrading ambiguous signs in QPNs. UAI, pp. 73-80, 2003.
5. J. H. Bolt, L. C. van der Gaag, and S. Renooij. The practicability of situational signs for QPNs. IPMU, pp. 1691-1698, 2004.
6. J. H. Bolt, L. C. van der Gaag, and S. Renooij. Introducing situational infiuences in QPNs. ECSQARU, pp. 113-124, 2003.
7. A. Cano and S. Moral. A genetic algorithm to approximate convex sets of probabilities. IPMU, volume 2, pp. 859-864, Granada, 1996.
8. A. Cano and S. Moral. Using probability trees to compute marginals with imprecise probabilities. Int. J. of Approximate Reasoning, 29:1-46, 2002. (Pubitemid 33060596)
9. R. G. Cowell, A. P. Dawid, S. L. Lauritzen, and D. J. Spiegelhalter. Probabilistic Networks and Expert Systems. Springer-Verlag, New York, 1999.
10. F. G. Cozman. Generalizing variable elimination in Bayesian networks. Workshop on Probabilistic Reasoning in Artificial Intelligence, pp. 27-32, Atibaia, Brazil, 2000.
11. F. G. Cozman, C. P. de Campos, J. S. Ide, and J. C. F. da Rocha. Propositional and relational Bayesian networks associated with imprecise and qualitative probabilistic assessments. UAI, pp. 104-111, 2004. AUAI Press.
12. F. G. Cozman. Credal networks. Artificial Intelligence, 120:199-233, 2000.
13. J. C. F. da Rocha, F. G. Cozman, and C. P. de Campos. Inference in polytrees with sets of probabilities. UAI, pp. 217-224, San Francisco, 2003. Morgan Kaufmann.
14. A. Darwiche and M. Goldszmidt. On the relation between kappa calculus and probabilistic reasoning. UAI, pp. 145-153, San Francisco, 1994. Morgan Kaufmann.
15. C. P. de Campos and F. G. Cozman. Inference in credal networks using multilinear programming. Proc. of the Second Starting AI Researcher Symp., pp. 50-61, Valencia, 2004. IOS Press.
16. UAI, pp. 120-129. AUAI Press, 2004.
17. M. DeGroot. Optimal Statistical Decisions. McGraw-Hill, New York, 1970.
18. M. J. Druzdzel and M. Henrion. Belief propagation in qualitative probabilistic networks. Qualitative Reasoning and Decision Technologies, pp. 451-460. Barcelona, 1993.
19. M. J. Druzdzel and M. Henrion. Efficient reasoning in qualitative probabilistic networks. AAAI, pp. 548-553, 1993.
20. M. J. Druzdzel and L. C. van der Gaag. Elicitation of probabilities for belief networks: Combining qualitative and quantitative information. UAI, pp. 141-148, 1995.
21. E. Fagiuoli and M. Zaffalon. 2U: An exact interval propagation algorithm for polytrees with binary variables. Artificial Intelligence, 106(1):77.107, 1998. (Pubitemid 128402351)
22. T. Hailperin. Sentential Probability Logic. Lehigh University Press, Bethlehem, 1996.
23. P. Hansen and B. Jaumard. Probabilistic satisfiability. Technical Report G-96-31, Les Cahiers du GERAD, École Polytechique de Montréal, 1996.
24. D. Heckerman. A tutorial on learning with Bayesian networks. Technical Report MSR-TR-95-06, Microsoft Research, March 1995 (revised November, 1996).
25. J. S. Ide and F. G. Cozman. Random generation of Bayesian networks. Brazilian Symp. on Artificial Intelligence, pp. 366-375, Recife, 2002. Springer-Verlag.
26. I. Levi. The Enterprise of Knowledge. MIT Press, Cambridge, Massachusetts, 1980.
27. N. J. Nilsson. Probabilistic logic. Artificial Intelligence, 28:71-87, 1986.
28. J. D. Park and A. Darwiche. Complexity results and approximation strategies for MAP explanations. J. of Artificial Intelligence Research, 21:101-133, 2004. (Pubitemid 41525899)
29. S. Parsons and M. Dohnal. A semiqualitative approach to reasoning in probabilistic networks. Applied Artificial Intelligence, 7:223-235, 1993. (Pubitemid 23695437)
30. E. Quaeghebeur and G. de Cooman. Game-theoretic learning using the imprecise Dirichlet model. Proc. of the Third Int. Symp. on Imprecise Probabilities and Their Applications, pp. 450-464, 2003.
31. S. Renooij, S. Parsons, and P. Pardieck. Using kappas as indicators of strength in qualitative probabilistic networks. ECSQARU, pp. 87-99. Springer Verlag, 2003. (Pubitemid 36904896)
32. S. Renooij and L. C. van der Gaag. Enhancing QPNs for trade-off resolution. UAI, pp. 559-566, 1999.
33. S. Renooij and L. C. van der Gaag. Exploiting nonmonotonic infiuences in qualitative belief networks. IPMU, pp. 1285-1290, Madrid, Spain, 2000.
34. S. Renooij and L. C. van der Gaag. From qualitative to quantitative probabilistic networks. UAI, pp. 422-429, San Francisco, CA, 2002. Morgan Kaufmann.
35. S. Renooij, L. C. van der Gaag, and S. Parsons. Propagation of multiple observations in qualitative probabilistic networks. Proc. Belgium-Netherlands Conf. on Artificial Intelligence, pp. 235-242, 2000.
36. S. Renooij, L. C. van der Gaag, and S. Parsons. Context-specific sign-propagation in qualitative probabilistic networks. Artificial Intelligence, 140(1-2):207-230, 2002. (Pubitemid 34965460)
37. H. D. Sherali and C. H. Tuncbilek. A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. of Global Optimization, 2:101-112, 1992.
38. L. C. van der Gaag. Computing probability intervals under independency constraints. Uncertainty in Artificial Intelligence 6, pp. 457-466. Elsevier Science, 1991.
39. L. C. van der Gaag, H. L. Bodlaender, and A. Feelders. Monotonicity in Bayesian networks. UAI, pp. 569-576. AUAI Press, 2004.
40. P. Walley. Statistical Reasoning with Imprecise Probabilities. Chapman and Hall, London, 1991.
41. P. Walley. Inferences from multinomial data: Learning about a bag of marbles. J. Royal Statistical Society B, 58(1):3-57, 1996.
42. M. P. Wellman. Fundamental concepts of qualitative probabilistic networks. Artificial Intelligence, 44(3):257-303, 1990.
43. F. Wittig and A. Jameson. Exploiting qualitative knowledge in the learning of conditional probabilities of Bayesian networks. UAI, pp. 644-652, 2000.
44. M. Zaffalon. Exact credal treatment of missing data. J. of Probabilistic Planning and Inference, 105(1):105-122, 2002.