Interval probability propagation

Abstract Belief networks are tried as a method for propagation of singleton interval probabilities. A convex polytope representation of the interval probabilities is shown to make the problem intractable even for small parameters. A solution to this is to use the interval bounds directly in computations of the propagation algorithm. The algorithm presented leads to approximative results but has the advantage of being polynomial in time. It is shown that the method gives fairly good results.

[1]  John S. Breese,et al.  Interval Influence Diagrams , 1989, UAI.

[2]  Henry E. Kyburg,et al.  Representing knowledge and evidence for decision , 1986, IPMU.

[3]  Dimiter Driankov.  A Many Valued Logic of Belief: Detachment Operators , 1988, IPMU.

[4]  Dimiter Driankov.  A calculus for believ-intervals representation of uncertainty , 1986, IPMU.

[5]  Paul Snow.  Bayesian Inference without Point Estimates , 1986, AAAI.

[6]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[7]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[8]  Henry E. Kyburg,et al.  Bayesian and Non-Bayesian Evidential Updating , 1987, Artificial Intelligence.

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  Chelsea C. White,et al.  A Posteriori Representations Based on Linear Inequality Descriptions of a Priori and Conditional Probabilities , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Dean Isaacson,et al.  Markov Chains: Theory and Applications , 1976 .

[12]  D. F. Kerridge,et al.  The Logic of Decision , 1967 .

[13]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[14]  Didier Dubois,et al.  Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .