Skip to main content

Graphical Reasoning with Bayesian Networks

  • Conference paper
Research and Development in Intelligent Systems XXIII (SGAI 2006)

Abstract

Nowadays, Bayesian networks are seen by many researchers as standard tools for reasoning with uncertainty. Despite the fact that Bayesian networks are graphical representations, representing dependence and independence information, normally the emphasis of the visualisation of the reasoning process is on showing changes in the associated marginal probability distributions due to entering observations, rather than on changes in the associated graph structure. In this paper, we argue that it is possible and relevant to look at Bayesian network reasoning as reasoning with a graph structure, depicting changes in the dependence and independence information. We propose a new method that is able to modify the graphical part of a Bayesian network to bring it in accordance with available observations. In this way, Bayesian network reasoning is seen as reasoning about changing dependences and independences as reflected by changes in the graph structure.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Andersson, S. A., Madigan, D., and Perlman, M. D. A Characterization of Markov Equivalence Classes for Acyclic Digraphs. Annals of Statistic 25 (1997), 505–541.

    Article  MATH  MathSciNet  Google Scholar 

  2. Cowell, R. G., Dawid, A. P., Lauritzen, S. L., and Spiegelhalter, D. J. Probabilistic Networks and Expert Systems. Springer-Verlag New York, 1999.

    MATH  Google Scholar 

  3. Flesch, I., and Lucas, P.J.F. Markov Equivalence in Bayesian Networks. Technical Report, Radboud University Nijmegen, NIII-R0436, 2004.

    Google Scholar 

  4. Gaag, L. C. van der. Evidence Absorption for Belief Networks. Technical Report RUU-CS-93-35, Utrecht University, 1993.

    Google Scholar 

  5. Richardson, T., and Spirtes, P. Ancestral graph Markov models. Annals of Statistics 30 (2002), 962–1030.

    Article  MATH  MathSciNet  Google Scholar 

  6. Studeny, M. Probabilistic Conditional Independence Structures. Springer-Verlag London, 2005.

    MATH  Google Scholar 

  7. Verma, T., and Pearl, J. Equivalence and synthesis of causal models. In UAF90 (San Francisco, CA, 1990), Morgan Kaufmann, pp. 220–227.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag London Limited

About this paper

Cite this paper

Flesch, I., Lucas, P. (2007). Graphical Reasoning with Bayesian Networks. In: Bramer, M., Coenen, F., Tuson, A. (eds) Research and Development in Intelligent Systems XXIII. SGAI 2006. Springer, London. https://doi.org/10.1007/978-1-84628-663-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-84628-663-6_6

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84628-662-9

  • Online ISBN: 978-1-84628-663-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics