Credal networks

Artificial Intelligence

Volumn 120, Issue 2, 2000, Pages 199-233

  Cozman, Fabio G ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

Author keywords

Bayesian networks; Convex sets of probability measures; Graphical d separation relations; Graphical models of inference; Independence relations; Lower and upper expectations; Robust bayesian analysis

Indexed keywords

EID: 0010358630     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00029-1     Document Type: Article

References (84)

1. K.A. Andersen, J.N. Hooker, Bayesian logic, Decision Support Systems 11 (1994) 191-210.
2. M. Avriel, Advances in Geometric Programming, Plenum Press, New York, 1980.
3. M. Avriel, R. Dembo, U. Passy, Solution of generalized geometric programs, in: M. Avriel (Ed.), Advances in Geometric Programming, Plenum Press, New York, 1980, pp. 203-226.
4. F. Bacchus, Representing and Reasoning with Probabilistic Knowledge: A Logical Approach, MIT Press, Cambridge, MA, 1990.
5. J. Berger, E. Moreno, Bayesian robustness in bidimensional model: Prior independence, J. Statist. Plann. Inference 40 (1994) 161-176.
6. J.O. Berger, Statistical Decision Theory and Bayesian Analysis, Springer, Berlin, 1985.
7. J.O. Berger, Robust Bayesian analysis: Sensitivity to the prior, J. Statist. Plann.Inference 25 (1990) 303-328.
8. J.S. Breese, K.W. Fertig, Decision making with interval influence diagrams, in: P.P. Bonissone, M. Henrion, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence 6, Elsevier Science, North-Holland, Amsterdam, 1991, pp. 467-478.
9. W.L. Buntine, Operations for learning with graphical models, J. Artificial Intelligence Res. 2 (1994) 159-225.
10. A. Cano, J.E. Cano, S. Moral, Convex sets of probabilities propagation by simulated annealing, in: G. Goos, J. Hartmanis, J. van Leeuwen (Eds.), Proc. International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris, France, July 1994, pp. 4-8.
11. A. Cano, S. Moral, A genetic algorithm to approximate convex sets of probabilities, in: Proc. International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Granada, Spain, 1996, pp. 859-864.
12. J. Cano, M. Delgado, S. Moral, An axiomatic framework for propagating uncertainty in directed acyclic networks, Internat. J. Approx. Reason. 8 (1993) 253-280.
13. E. Charniak, Bayesian networks without tears, AI Magazine 12 (4) (1991) 50-63.
14. L. Chrisman, Incremental conditioning of lower and upper probabilities, Internat. J. Approx. Reason. 13 (1) (1995) 1-25.
15. L. Chrisman, Independence with lower and upper probabilities, in: E. Horvitz, F. Jensen (Eds.), Proc. XII Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1996, pp. 169-177.
16. L. Chrisman, Propagation of 2-monotone lower probabilities on an undirected graph, in: E. Horvitz, F. Jensen (Eds.), Proc. XII Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1996, pp. 178-186.
17. K.L. Clarkson, K. Mehlhorn, R. Seidel, Four results on randomized incremental constructions, in: International Symposium on Theoretical Aspects of Computer Science (STACS), 1992, pp. 463-474.
18. G.F. Cooper, The computational complexity of probabilistic inference using Bayesian belief networks, Artificial Intelligence 42 (1990) 393-405.
19. I. Couso, S. Moral, P. Walley, Examples of independence for imprecise probabilities, in: G. de Cooman, F.G. Cozman, S. Moral, P. Walley (Eds.), Proc. 1st International Symposium on Imprecise Probabilities and Their Applications, Imprecise Probabilities Project, Universiteit Gent, Ghent, Belgium, 1999, pp. 121-130.
20. F.G. Cozman, Robustness analysis of Bayesian networks with local convex sets of distributions, in: D. Geiger, P. Shenoy (Eds.), Proc. XIII Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1997, pp. 108-115.
21. F.G. Cozman, Irrelevance and independence in Quasi-Bayesian networks, in: G. Cooper, S. Moral (Eds.), Proc. XIV Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1998, pp. 89-96.
22. F.G. Cozman, Irrelevance and independence axioms in quasi-Bayesian theory, in: A. Hunter, S. Parsons (Eds.), Proc. European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU), Springer, London, 1999, pp. 128-136.
23. L. de Campos, S. Moral, Independence concepts for convex sets of probabilities, in: P. Besnard, S. Hanks (Eds.), Proc. XI Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1995, pp. 108-115.
24. G. de Cooman, F.G. Cozman, S. Moral, P. Walley (Eds.), Proc. 1st International Symposium on Imprecise Probabilities and Their Applications, Imprecise Probabilities Project, Universiteit Gent, Ghent, Belgium, 1999.
25. R. Dechter, Bucket elimination: A unifying framework for probabilistic inference, in: E. Horvitz, F. Jensen (Eds.), Proc. XII Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1996, pp. 211-219.
26. L. DeRobertis, J.A. Hartigan, Bayesian inference using intervals of measures, Ann. Statist. 9 (2) (1981) 235-244.
27. R.J. Duffin, E.L. Peterson, Geometric programming with signomials, J. Optim. Theory Appl. 11 (1) (1973) 3-35.
28. J. Earman, Bayes or Bust?, MIT Press, Cambridge, MA, 1992.
29. E. Fagiuoli, M. Zaffalon, 2U: An exact interval propagation algorithm for polytrees with binary variables, Artificial Intelligence 106 (1) (1998) 77-107.
30. J. Falk, R. Soland, An algorithm for separable nonconvex programming problems, Management Science 15 (1969) 550-569.
31. T.L. Fine, Lower probability models for uncertainty and nondeterministic processes, J. Statist. Plann. Inference 20 (1988) 389-411.
32. J. Gebhardt, R. Kruse, Learning possibilistic networks from data, in: Proc. 5th International Workshop on Artificial Intelligence and Statistics, Fort Lauderdale, FL, 1995, pp. 233-243.
33. D. Geiger, T Verma, J. Pearl, d-separation: from theorems to algorithms, in: M. Henrion, R.D. Shachter, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence 5, Elsevier Science, Amsterdam, 1990, pp. 139-148.
34. F.J. Giron, S. Rios, Quasi-Bayesian behaviour: A more realistic approach to decision making?, in: J.M. Bernardo, J.H. DeGroot, D.V. Lindley, A.F.M. Smith (Eds.), Bayesian Statistics, University Press, Valencia, 1980, pp. 17-38.
35. W. Gochet, Y. Smeers, A branch-and-bound method for reversed geometric programming, Oper. Res. 27 (5) (1979) 983-996.
36. I.J. Good, Good Thinking: The Foundations of Probability and its Applications, University of Minnesota Press, Minneapolis, MN, 1983.
37. P. Gritzmann, V. Klee, Mathematical programming and convex geometry, in: P. Gruber, J.M. Wills (Eds.), Handbook of Convex Geometry A, Elsevier Science, Amsterdam, 1993, pp. 627-674.
38. V. Ha, P. Haddawy, Theoretical foundations for abstraction-based probabilistic planning, in: E. Horvitz, F. Jensen (Eds.), Proc. XII Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1996, pp. 291-298.
39. T. Hailperin, Sentential Probability Logic, Lehigh University Press, Bethlehem, PA, 1996.
40. J.Y. Halpern, R. Fagin, Two views of belief: Belief as generalized probability and belief as evidence, Artificial Intelligence 54 (1992) 275-317.
41. T. Herron, T. Seidenfeld, L. Wasserman, Divisive conditioning: Further results on dilation, Technical Report 585, Department of Statistics, Carnegie Mellon University, Pittsburgh, PA, 1993.
42. T. Ibaraki, Solving mathematical programming problems with fractional objective functions, in: S. Schaible, W.T. Ziemba (Eds.), Generalized Concavity in Optimization and Economics, Academic Press, New York, 1981, pp. 440-472.
43. B. Jaumard, P. Hansen, M.P. de Aragão, Column generation methods for probabilistic logic, ORSA J. Comput. 3 (2) (1991) 135-148.
44. F.V. Jensen, An Introduction to Bayesian Networks, Springer, New York, 1996.
45. J.B. Kadane (Ed.), Robustness of Bayesian Analyses, Studies in Bayesian Econometrics, Vol. 4, Elsevier Science, New York, 1984.
46. R.B. Kearfott, A review of techniques in the verified solution of constrained global optimization problems, in: R.B. Kearfott, V Kreinovich (Eds.), Applications of Interval Computations, Kluwer, Dordrecht, 1996, pp. 23-60.
47. H.E. Kyburg Jr., Bayesian and non-Bayesian evidential updating, Artificial Intelligence 31 (1987) 271-293.
48. H.E. Kyburg Jr., M. Pittarelli, Set-based Bayesianism, IEEE Trans. Systems Man Cybernet. A 26 (3) (1996) 324-339.
49. K.B. Laskey, Sensitivity analysis for probability assessments in Bayesian networks, IEEE Trans. Systems Man Cybernet. 25 (6) (1995) 901-909.
50. M. Lavine, Sensitivity in Bayesian statistics, the prior and the likelihood, J. Amer. Statist. Assoc. 86 (414) (1991) 396-399.
51. J.F. Lemmer, H.E. Kyburg Jr., Conditions for the existence of belief functions corresponding to intervals of belief, in: Proc. AAAI-91, Anaheim, CA, 1991, pp. 488-493.
52. I. Levi, The Enterprise of Knowledge, The MIT Press, Cambridge, MA, 1980.
53. D.G. Luenberger, Linear and Nonlinear Programming, Addison-Wesley, Reading, MA, 1989.
54. T. Lukasiewicz, Uncertain reasoning in concept lattices, in: Proc. 3rd European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, 1995, pp. 293-300.
55. C. Luo, C. Yu, J. Lobo, G. Wang, T. Pham, Computation of best bounds of probabilities from uncertain data, Computational Intelligence 12 (4) (1996) 541-566.
56. S. Moral, A formal language for convex sets of probabilities, in: M.R.B. Clarke, R. Kruse, S. Moral (Eds.), Proc. European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU), Springer, Berlin, 1993, pp. 274-281.
57. R. Musick, Minimal assumption distribution propagation in belief networks, in: D. Heckerman, A. Mamdani (Eds.), Proc. IX Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann, San Francisco, CA, 1993, pp. 251-258.
58. N.J. Nilsson, Probabilistic logic, Artificial Intelligence 28 (1986) 71-87.
59. A. Papoulis, Probabilities, Random Variables and Stochastic Processes, McGraw-Hill, New York, 1991.
60. U. Passy, Global solutions of mathematical programs with intrinsically concave functions, in: M. Avriel (Ed.), Advances in Geometric Programming, Plenum Press, New York, 1980, pp. 355-373.
61. J. Pearl, On probability intervals, Internat. J. Approx. Reason. 2 (1988) 211-216.
62. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmann, San Mateo, CA, 1988.
63. E.H. Ruspini, The logical foundations of evidential reasoning, Technical Report SRIN408, SRI International, Menlo Park, CA, 1987.
64. S. Russell, J. Binder, D. Koller, K. Kanazawa, Local learning in probabilistic networks with hidden variables, in: Proc. IJCAI-95, Montreal, Quebec, 1995, pp. 1146-1152.
65. S.J. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Prentice Hall, Englewood Cliffs, NJ, 1995.
66. S.I. Schaible, W.T. Ziemba, Generalized Concavity in Optimization and Economics, Academic Press, New York, 1981.
67. T. Seidenfeld, Outline of a theory of partially ordered preferences, Philosophical Topics 21 (1) (1993) 173-188.
68. G. Shafer, A Mathematical Theory of Evidence, Princeton University Press, Princeton, NJ, 1976.
69. P.P. Shenoy, G. Shafer, Axioms for probability and belief-function propagation, in: R.D. Shachter, T.S. Levitt, L.N. Kanal, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence 4, Elsevier Science, North-Holland, Amsterdam, 1990, pp. 169-198.
70. E.H. Shortliffe, B.G. Buchanan, Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project, Addison-Wesley, Reading, MA, 1985.
71. C.A.B. Smith, Consistency in statistical inference and decision, J. Roy. Statist. Soc. B 23 (1961) 1-25.
72. P. Spirtes, C. Glymour, R. Scheines, Causality, Prediction, and Search, Springer, New York, 1993.
73. P. Suppes, The measurement of belief, J. Roy. Statist. Soc. B 2 (1974) 160-191.
74. B. Tessem, Interval probability propagation, Internat. J. Approx. Reason. 7 (1992) 95-120.
75. L. van der Gaag, Computing probability intervals under independency constraints, in: P.P. Bonissone, M. Henrion, J.F. Lemmer (Eds.), Uncertainty in Artificial Intelligence 6, Elsevier Science, Amsterdam, 1991, pp. 457-466.
76. P. Walley, Statistical Reasoning with Imprecise Probabilities, Chapman and Hall, London, 1991.
77. P. Walley, Measures of uncertainty in expert systems, Artificial Intelligence 83 (1996) 1-58.
78. P. Walley, T.L. Fine, Towards a frequentist theory of upper and lower probability, Ann. Statist. 10 (3) (1982) 741-761.
79. L.A. Wasserman, Invariance properties of density ratio priors, Ann. Statist. 20 (4) (1992) 2177-2182.
80. L.A. Wasserman, Recent methodological advances in robust Bayesian inference, in: J.M. Bernardo, J.O. Berger, A.P. Dawid, A.F.M. Smith (Eds.), Bayesian Statistics 4, Oxford University Press, Oxford, 1992, pp. 483-502.
81. L.A. Wasserman, J.B. Kadane, Computing bounds on expectations, J. Amer. Statist. Assoc. 87 (418) (1992) 516-522.
82. L.A. Wasserman, J.B. Kadane, Bayes' theorem for Choquet capacities, Ann. Statist. 18 (3) (1990) 1328-1339.
83. M. Zaffalon, Inferenze e Decisioni in Condizioni di Incertezza con Modelli Grafici Orientati, Ph.D. Thesis, Università di Milano, Milan, Italy, 1997.
84. M. Zaffalon, A credal approach to naive classification, in: G. de Cooman, F.G. Cozman, S. Moral, P. Walley (Eds.), Proc. 1st International Symposium on Imprecise Probabilities and Their Applications, Imprecise Probabilities Project, Universiteit Gent, Ghent, Belgium, 1999, pp. 405-414.