Using Qualitative Relationships for Bounding Probability Distributions

We exploit qualitative probabilistic relationships among variables for computing bounds of conditional probability distributions of interest in Bayesian networks. Using the signs of qualitative relationships, we can implement abstraction operations that are guaranteed to bound the distributions of interest in the desired direction. By evaluating incrementally improved approximate networks, our algorithm obtains monotonically tightening bounds that converge to exact distributions. For supermodular utility functions, the tightening bounds monotonically reduce the set of admissible decision alternatives as well.

[1]  Fabio Gagliardi Cozman,et al.  Robustness Analysis of Bayesian Networks with Local Convex Sets of Distributions , 1997, UAI.

[2]  L. N. Kanal,et al.  Uncertainty in Artificial Intelligence 5 , 1990 .

[3]  R. van Engelen,et al.  Approximating Bayesian belief networks by arc removal , 1997, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Mark S. Boddy,et al.  Deliberation Scheduling for Problem Solving in Time-Constrained Environments , 1994, Artif. Intell..

[5]  Eric Horvitz,et al.  Bounded Conditioning: Flexible Inference for Decisions under Scarce Resources , 2013, UAI 1989.

[6]  Lonnie Chrisman,et al.  Incremental conditioning of lower and upper probabilities , 1995, Int. J. Approx. Reason..

[7]  Bruce D'Ambrosio,et al.  Incremental Probabilistic Inference , 1993, UAI.

[8]  Richard E. Neapolitan,et al.  Probabilistic reasoning in expert systems - theory and algorithms , 2012 .

[9]  Michael P. Wellman,et al.  State-Space Abstraction for Anytime Evaluation of Probabilistic Networks , 1994, UAI.

[10]  P. Walley Statistical Reasoning with Imprecise Probabilities , 1990 .

[11]  Michael I. Jordan,et al.  Computing upper and lower bounds on likelihoods in intractable networks , 1996, UAI.

[12]  Denise Draper,et al.  Localized Partial Evaluation of Belief Networks , 1994, UAI.

[13]  David Poole,et al.  Average-Case Analysis of a Search Algorithm for Estimating Prior and Posterior Probabilities in Bayesian Networks with Extreme Probabilities , 1993, IJCAI.

[14]  Michael P. Wellman,et al.  Incremental Tradeoff Resolution in Qualitative Probabilistic Networks , 1998, UAI.

[15]  J. Berger Statistical Decision Theory and Bayesian Analysis , 1988 .

[16]  Jorge Lobo,et al.  COMPUTATION OF BEST BOUNDS OF PROBABILITIES FROM UNCERTAIN DATA , 1996, Comput. Intell..

[17]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[18]  Eric Joel Hovitz Computation and action under bounded resources , 1991 .

[19]  Lonnie Chrisman,et al.  Propagation of 2-Monotone Lower Probabilities on an Undirected Graph , 1996, UAI.

[20]  Judea Pearl,et al.  Evidential Reasoning Using Stochastic Simulation of Causal Models , 1987, Artif. Intell..

[21]  Michael P. Wellman Fundamental Concepts of Qualitative Probabilistic Networks , 1990, Artif. Intell..

[22]  Rina Dechter,et al.  Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning , 1997, IJCAI.

[23]  Marek J. Druzdzel,et al.  Efficient Reasoning in Qualitative Probabilistic Networks , 1993, AAAI.

[24]  David Poole,et al.  Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference , 1997, IJCAI.

[25]  Michael Luby,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..

[26]  Michael P. Wellman,et al.  Path Planning under Time-Dependent Uncertainty , 1995, UAI.

[27]  Werner Kießling,et al.  Towards Precision of Probabilistic Bounds Propagation , 1992, UAI.