Computing Probabilities of Events in Bayesian Networks

  • Rolf Haenni
  • Jürg Kohlas
  • Norbert Lehmann
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 90)


This paper proposes a new approach for computing probabilities of events in Bayesian networks. The idea is to replace the outward phase of the propagation algorithm by a second (partial) inward propagation phase. The benefit of this idea is that the attention can be focussed on optimizing the inward phase.1


Bayesian Network Normalization Constant Belief Function Unique Path Incoming Message 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    R. Haenni, J. Kohlas, and N. Lehmann Probabilistic argumentation systems. Technical Report 99–9, Institute of Informatics, University of Fribourg, 1999.Google Scholar
  2. 2.
    F. Jensen, S. Lauritzen, and K. Olesen. Bayesian updating in causal probabilistic networks by local computations. SIAM Journal on Computing, 4: 269–282, 1990.MathSciNetGoogle Scholar
  3. 3.
    S. Lauritzen and D. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistical Society50(2):157–224, 1988. Google Scholar
  4. 4.
    N. Lehmann and R. Haenni. An alternative to outward propagation for Dempster-Shafer belief functions. In A. Hunter and S. Parsons, editors ECSQARU’99 Qualitative and Quantitative Approaches to Reasoning with Uncertainty. Springer, 1999. Google Scholar
  5. 5.
    V. Lepar and P. Shenoy. A comparison of Lauritzen-Spiegelhalter, Hugin and Shenoy-Shafer architectures for computing marginals of probability distributions. In G. Cooper and S. Moral, editors, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 328–337. Morgan Kaufmann, 1998.Google Scholar
  6. 6.
    P. Shenoy. Binary join trees. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence (UAI-96)pages 492–499. Morgan Kaufmann, 1996. Google Scholar
  7. 7.
    P. Shenoy and G. Shafer. Axioms for probability and belief functions propagation. In R. Shachter and al., editors, Uncertainty in Artificial Intelligence 4. North Holland, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Rolf Haenni
    • 1
  • Jürg Kohlas
    • 2
  • Norbert Lehmann
    • 2
  1. 1.Computer Science DepartmentUniversity of CaliforniaLos AngelesUSA
  2. 2.Department of InformaticsUniversity of FribourgSwitzerland

Personalised recommendations