Abstract
This chapter deals with Bayesian networks. The term usually refers to graphical models (most often with discrete variables) based on directed acyclic graphs (DAGs), applied in the expert system context. The emphasis differs somewhat from ordinary statistical modeling, since the DAG is usually taken as known and the focus is on efficient calculation of conditional probabilities of states of unobserved variables. Implemented naively, these calculations would be forbiddingly complex, but using message passing techniques they can be implemented very efficiently. (Somewhat confusingly, Bayesian networks are not in fact very Bayesian, in the sense that the Bayesian inferential methods are not normally used.) We explain the techniques and illustrate them on an example involving chest clinic data, using the package gRain. We show how appropriate R objects can be created, compiled and probability propagation performed in order to compute the required quantities. Topics covered in later sections include simulation and prediction using the network objects, use of the RHugin package, and structural learning, i.e., how the network may be learnt from the data.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cowell RG, Dawid AP, Lauritzen SL, Spiegelhalter DJ (1999) Probabilistic networks and expert systems. Springer, New York
Dawid AP (1992) Applications of a general propagation algorithm for probabilistic expert systems. Stat Comput 2:25–36
Green PJ (2005) GRAPPA: R functions for probability propagation. http://www.stats.bris.ac.uk/~peter/Grappa/
Højsgaard S, Thiesson B (1995) BIFROST—block recursive models induced from relevant knowledge, observations and statistical techniques. Comput Stat Data Anal 19:155–175
Kjærulff U (1990) Graph triangulation—algorithms giving small total state space. Technical report R 90-09, Aalborg University, Denmark
Lauritzen SL, Spiegelhalter DJ (1988) Local computations with probabilities on graphical structures and their application to expert systems (with discussion). J R Stat Soc B 50:157–224
Spirtes P, Glymour C (1991) An algorithm for fast recovery of sparse causal graphs. Soc Sci Comput Rev 9(1):62–72. http://ssc.sagepub.com/content/9/1/62.abstract
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Højsgaard, S., Edwards, D., Lauritzen, S. (2012). Bayesian Networks. In: Graphical Models with R. Use R!. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-2299-0_3
Download citation
DOI: https://doi.org/10.1007/978-1-4614-2299-0_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4614-2298-3
Online ISBN: 978-1-4614-2299-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)