Skip to main content
SpringerLink
Log in

An Alternative to Outward Propagation for Dempster-Shafer Belief Functions

  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1638))

Abstract

Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief function. The computation is based on a message passing scheme in a Markov tree where after the selection of a root node an inward and an outward propagation can be distinguished. In this paper it will be shown that outward propagation can be replaced by another partial inward propagation. In addition it will also be shown how the efficiency of inward propagation can be improved.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.G. Almond. Graphical Belief Modeling. Chapman & Hall, London, UK, 1995.

    Google Scholar 

  2. R. Bissig, J. Kohlas, and N. Lehmann. Fast-division architecture for dempstershafer belief functions. In Dov M. Gabbay, R. Kruse, A. Nonnengart, and H.J. Ohlbach, editors, First International Joint Conference on Qualitative and Quantitative Practical Reasoning ECSQARU-FAPR’97, Bad Honnef, pages 198–209. Springer-Verlag, 1997.

    Google Scholar 

  3. A.P. Dempster and A. Kong. Uncertain evidence and artificial analysis. Journal of Statistical Planning and Inference, 20:355–368, 1988.

    Article  MATH  Google Scholar 

  4. F.V. Jensen, K.G. Olesen, and S.K. Andersen. An algebra of bayesian belief universes for knowledge-based systems. Networks, 20(5):637–659, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  5. F.V. Jensen, S.L. Lauritzen, and K.G. Olesen. Bayesian updating in causal probabilistic networks by local computations. Computational Statistics Quarterly, 4:269–282, 1990.

    MathSciNet  Google Scholar 

  6. J. Kohlas and P.A. Monney. A Mathematical Theory of Hints. An Approach to the Dempster-Shafer Theory of Evidence, volume 425 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, 1995.

    Google Scholar 

  7. S.L. Lauritzen and F.V. Jensen. Local computation with valuations from a commutative semigroup. Annals of Mathematics and Artificial Intelligence, 21(1):51–70, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  8. S.L. Lauritzen and D.J. Spiegelhalter. Local computations with probabilities on graphical structures and their application to expert systems. Journal of Royal Statistical Society, 50(2):157–224, 1988.

    MATH  MathSciNet  Google Scholar 

  9. J. Pearl. Fusion, propagation and structuring in belief networks. Artificial Intelligence, 29:241–288, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Shafer. The Mathematical Theory of Evidence. Princeton University Press, 1976.

    Google Scholar 

  11. G. Shafer. An axiomatic study of computation in hypertrees. Working Paper 232, School of Business, The University of Kansas, 1991.

    Google Scholar 

  12. P.P. Shenoy. A valuation-based language for expert systems. International Journal of Approximate Reasoning, 3:383–411, 1989.

    Article  Google Scholar 

  13. P.P. Shenoy. Binary join trees for computing marginals in the Shenoy-Shafer architecture. International Journal of Approximate Reasoning, 17:239–263, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  14. P.P. Shenoy and G. Shafer. Axioms for probability and belief functions propagation. In R.D. Shachter and al., editors, Proceedings of the 4th Conference on Uncertainty in Artificial Intelligence, pages 169–198. North Holland, 1990.

    Google Scholar 

  15. Ph. Smets. Belief functions. In D. Dubois Ph. Smets, A. Mamdani and H. Prade, editors, Nonstandard logics for automated reasoning, pages 253–286. Academic Press, 1988.

    Google Scholar 

  16. V. Lepar and P.P. Shenoy. A comparison of Lauritzen-Spiegelhalter, Hugin and Shenoy-Shafer architectures for computing marginals of probability distributions. Uncertainty in Artificial Intelligence, 14:328–337, 1998.

    Google Scholar 

  17. H. Xu. An efficient implementation of belief function propagation. In D’Ambrosio B.D., Smets Ph., and Bonissone P.P., editors, Proceedings of the 7th Conference on Uncertainty in Artificial Intelligence, pages 425–432. Morgan Kaufmann, San Mateo, CA, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Fribourg, 1700, Fribourg, Switzerland

    Norbert Lehmann & Rolf Haenni

Authors
  1. Norbert Lehmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rolf Haenni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    Anthony Hunter

  2. Department of Electronic Engineering, University of London, Queen Mary and Westfield College, E1 4NS, London, UK

    Simon Parsons

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lehmann, N., Haenni, R. (1999). An Alternative to Outward Propagation for Dempster-Shafer Belief Functions. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-48747-6_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66131-3

  • Online ISBN: 978-3-540-48747-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation