Skip to main content

Updating Directed Belief Networks

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

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

Abstract

This paper deals with the knowledge representation and reasoning in directed belief networks. These networks are similar to those defined by Pearl (causal networks), but instead of probability functions, we use belief functions. Based on the work of Cano et al. [1992] in which they have presented an axiomatic framework for propagating valuations in directed acyclic graph using Shafer-Shenoy’s axioms of valuation-based system (VBS), we show how the Demptser-Shafer theory fist in this framework. Then, we present a propagation algorithm in directed belief networks that is extended from Pearl’s algorithm, but it is expressed in terms of belief functions.

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

Access this chapter

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

  • Ben Yaghlane B., Khalfallah F., and Mellouli K. (1998) Propagating Conditional Belief Functions in Directed Acyclic Networks, CESA’ 98, IEEE Systems, Man and Cybernetics, Tunisia, 2, pp 232–238.

    Google Scholar 

  • Cano, J., Delgado M. and Moral S. (1992) An Axiomatic Framework for Propagating Uncertainty in Directed Acyclic networks, Int. J. of Approximate Reasoning, 8: 253–280.

    Article  MathSciNet  Google Scholar 

  • David A.P. (1979) Conditional Independence in Statistical Theory, Journal of the Royal Statistical Society, Series B, 41, 1–31

    Google Scholar 

  • Khalfallah F., Ben yaghlane B. and Mellouli K. (1998) Propagating Multi-Observations in Directed Belief Networks, IEEE-SMC’98, IEEE Systems, Man and Cybernetics, San Diego (USA), pp. 2472–2477.

    Google Scholar 

  • Lauritzen S. L., Dawid A. P., Larsen B. N. And Leimer H. G. (1990), Independence Properties of Directed Markov Fields, networks, 20(5), 491–505.

    Article  MATH  MathSciNet  Google Scholar 

  • Mellouli K. (1987) On the Propagation of Beliefs in Network using Dempster-Shafer Theory of Evidence, Doctoral Dissertation, University of Kansas.

    Google Scholar 

  • Pearl J. (1988) Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, morgan Kaufmann, San Mateo, CA.

    Google Scholar 

  • Shafer G. (1976) A Mathematical theory of Evidence, Princeton Univ. Press, NJ.

    MATH  Google Scholar 

  • Shafer G., Shenoy P.P., and Mellouli K. (1987) Propagating Belief Functions in Qualitative Markov Trees, Inter. J. of Approximate Reasoning, 1:349–400.

    Article  MATH  MathSciNet  Google Scholar 

  • Shafer G. and Shenoy P.P. (1988) Local Computation in Hypertrees, Working paper No 201, School of Business, University of Kansas, Lawrence, KS.

    Google Scholar 

  • Shenoy P.P. (1989) A Valuation-based Language for Expert Systems, Inter. J. of Approximate Reasoning, 3(5), pp 383–411.

    Article  Google Scholar 

  • Shenoy P.P. (1993) Valuation Networks and Conditional Independence, in Heckerman D. And Mamdani A. eds. Proc. 9th UAI, Morgan Kaufmann, San Mateo, CA, 191–199.

    Google Scholar 

  • Shenoy P.P. and Shafer g. (1990) Axioms for Probability and Belief-Function Propagation, in Shachter R.D., Levitt T.S., Kanal L.N. and Lemmer J.F. eds UAI, 4, 169–198.

    Google Scholar 

  • Smets Ph. (1988) Belief Functions, in (Ph. Smets, A. Mamdani, D. Dubois, and H. Prade, Eds), Nonstandard Logics for Automated Reasoning, Academic Press, London, 253–286.

    Google Scholar 

  • Smets Ph. 91993), Belief Functions: The Disjunctive Rule of Combination and the Generalized Bayesian Theorem, Int. J. of Approximate Reasoning.,9:1–35.

    Google Scholar 

  • Xu H. and Smets Ph. (1996) Reasoning in Evidential Networks with Conditional Belief Functions, Int. Journal of Approximate Reasoning, 14:155–185.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yaghlane, B.B., Mellouli, K. (1999). Updating Directed Belief Networks. 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_5

Download citation

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

  • 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