World Library  
Flag as Inappropriate
Email this Article

Bayesian network

Article Id: WHEBN0000203996
Reproduction Date:

Title: Bayesian network  
Author: World Heritage Encyclopedia
Language: English
Subject: Bayesian programming, Artificial intelligence, Credal network, Belief propagation, Network theory in risk assessment
Collection: Bayesian Networks, Graphical Models, Networks, Statistical Models
Publisher: World Heritage Encyclopedia

Bayesian network

A simple Bayesian network. Rain influences whether the sprinkler is activated, and both rain and the sprinkler influence whether the grass is wet.

A Bayesian network, Bayes network, belief network, Bayes(ian) model or probabilistic directed acyclic graphical model is a probabilistic graphical model (a type of statistical model) that represents a set of random variables and their conditional dependencies via a directed acyclic graph (DAG). For example, a Bayesian network could represent the probabilistic relationships between diseases and symptoms. Given symptoms, the network can be used to compute the probabilities of the presence of various diseases.

Formally, Bayesian networks are DAGs whose nodes represent random variables in the Bayesian sense: they may be observable quantities, latent variables, unknown parameters or hypotheses. Edges represent conditional dependencies; nodes that are not connected represent variables that are conditionally independent of each other. Each node is associated with a probability function that takes, as input, a particular set of values for the node's parent variables, and gives (as output) the probability (or probability distribution, if applicable) of the variable represented by the node. For example, if m parent nodes represent m Boolean variables then the probability function could be represented by a table of 2^m entries, one entry for each of the 2^m possible combinations of its parents being true or false. Similar ideas may be applied to undirected, and possibly cyclic, graphs; such are called Markov networks.

Efficient algorithms exist that perform inference and learning in Bayesian networks. Bayesian networks that model sequences of variables (e.g. speech signals or protein sequences) are called dynamic Bayesian networks. Generalizations of Bayesian networks that can represent and solve decision problems under uncertainty are called influence diagrams.


  • Example 1
  • Inference and learning 2
    • Inferring unobserved variables 2.1
    • Parameter learning 2.2
    • Structure learning 2.3
  • Statistical introduction 3
    • Introductory examples 3.1
    • Restrictions on priors 3.2
  • Definitions and concepts 4
    • Factorization definition 4.1
    • Local Markov property 4.2
    • Developing Bayesian networks 4.3
    • Markov blanket 4.4
      • d-separation 4.4.1
    • Hierarchical models 4.5
    • Causal networks 4.6
  • Inference complexity and approximation algorithms 5
  • Applications 6
    • Software 6.1
  • History 7
  • See also 8
  • Notes 9
  • References 10
  • Further reading 11
  • External links 12


A simple Bayesian network with conditional probability tables

Suppose that there are two events which could cause grass to be wet: either the sprinkler is on or it's raining. Also, suppose that the rain has a direct effect on the use of the sprinkler (namely that when it rains, the sprinkler is usually not turned on). Then the situation can be modeled with a Bayesian network (shown). All three variables have two possible values, T (for true) and F (for false).

The joint probability function is:

\mathrm P(G,S,R)=\mathrm P(G\mid S,R)\mathrm P(S\mid R)\mathrm P(R)

where the names of the variables have been abbreviated to G = Grass wet (yes/no), S = Sprinkler turned on (yes/no), and R = Raining (yes/no).

The model can answer questions like "What is the probability that it is raining, given the grass is wet?" by using the conditional probability formula and summing over all nuisance variables:

\mathrm P(\mathit{R}=T \mid \mathit{G}=T) =\frac{ \mathrm P(\mathit{G}=T,\mathit{R}=T) } { \mathrm P(\mathit{G}=T) } =\frac{ \sum_{\mathit{S} \in \{T, F\}}\mathrm P(\mathit{G}=T,\mathit{S},\mathit{R}=T) } { \sum_{\mathit{S}, \mathit{R} \in \{T, F\}} \mathrm P(\mathit{G}=T,\mathit{S},\mathit{R}) }

Using the expansion for the joint probability function \mathrm P(G,S,R) and the conditional probabilities from the conditional probability tables (CPTs) stated in the diagram, one can evaluate each term in the sums in the numerator and denominator. For example,

\begin{align} \mathrm P(G=T, & \,S=T,R=T) \\ & = \mathrm P(G=T\mid S=T,R=T)\mathrm P(S=T\mid R=T)\mathrm P(R=T) \\ & = 0.99 \times 0.01 \times 0.2 \\ & = 0.00198. \end{align}

Then the numerical results (subscripted by the associated variable values) are

\begin{align} \mathrm P(R=T \mid G=T) & = \frac{ 0.00198_{TTT} + 0.1584_{TFT} } { 0.00198_{TTT} + 0.288_{TTF} + 0.1584_{TFT} + 0.0_{TFF} } \\ & = \frac{891}{2491}\approx 35.77 \%. \end{align}

If, on the other hand, we wish to answer an interventional question: "What is the probability that it would rain, given that we wet the grass?" the answer would be governed by the post-intervention joint distribution function \mathrm P(S,R\mid \text{do}(G=T)) = P(S\mid R) P(R) obtained by removing the factor \mathrm P(G\mid S,R) from the pre-intervention distribution. As expected, the probability of rain is unaffected by the action: \mathrm P(R\mid\text{do}(G=T)) = P(R).

If, moreover, we wish to predict the impact of turning the sprinkler on, we have

P(R,G\mid \text{do}(S=T)) = P(R)P(G\mid R,S=T)

with the term P(S=T\mid R) removed, showing that the action has an effect on the grass but not on the rain.

These predictions may not be feasible when some of the variables are unobserved, as in most policy evaluation problems. The effect of the action \text{do}(x) can still be predicted, however, whenever a criterion called "back-door" is satisfied.[1][2] It states that, if a set Z of nodes can be observed that d-separates[3] (or blocks) all back-door paths from X to Y then P(Y,Z\mid \text{do}(x)) = P(Y,Z,X=x)/P(X=x\mid Z). A back-door path is one that ends with an arrow into X. Sets that satisfy the back-door criterion are called "sufficient" or "admissible." For example, the set Z = R is admissible for predicting the effect of S = T on G, because R d-separate the (only) back-door path S ← R → G. However, if S is not observed, there is no other set that d-separates this path and the effect of turning the sprinkler on (S = T) on the grass (G) cannot be predicted from passive observations. We then say that P(G | do(S = T)) is not "identified." This reflects the fact that, lacking interventional data, we cannot determine if the observed dependence between S and G is due to a causal connection or is spurious (apparent dependence arising from a common cause, R). (see Simpson's paradox)

To determine whether a causal relation is identified from an arbitrary Bayesian network with unobserved variables, one can use the three rules of "do-calculus"[1][4] and test whether all do terms can be removed from the expression of that relation, thus confirming that the desired quantity is estimable from frequency data.[5]

Using a Bayesian network can save considerable amounts of memory, if the dependencies in the joint distribution are sparse. For example, a naive way of storing the conditional probabilities of 10 two-valued variables as a table requires storage space for 2^{10} = 1024 values. If the local distributions of no variable depends on more than three parent variables, the Bayesian network representation only needs to store at most 10\cdot2^3 = 80 values.

One advantage of Bayesian networks is that it is intuitively easier for a human to understand (a sparse set of) direct dependencies and local distributions than complete joint distributions.

Inference and learning

There are three main inference tasks for Bayesian networks.

Inferring unobserved variables

Because a Bayesian network is a complete model for the variables and their relationships, it can be used to answer probabilistic queries about them. For example, the network can be used to find out updated knowledge of the state of a subset of variables when other variables (the evidence variables) are observed. This process of computing the posterior distribution of variables given evidence is called probabilistic inference. The posterior gives a universal sufficient statistic for detection applications, when one wants to choose values for the variable subset which minimize some expected loss function, for instance the probability of decision error. A Bayesian network can thus be considered a mechanism for automatically applying Bayes' theorem to complex problems.

The most common exact inference methods are: variable elimination, which eliminates (by integration or summation) the non-observed non-query variables one by one by distributing the sum over the product; clique tree propagation, which caches the computation so that many variables can be queried at one time and new evidence can be propagated quickly; and recursive conditioning and AND/OR search, which allow for a space-time tradeoff and match the efficiency of variable elimination when enough space is used. All of these methods have complexity that is exponential in the network's treewidth. The most common approximate inference algorithms are importance sampling, stochastic MCMC simulation, mini-bucket elimination, loopy belief propagation, generalized belief propagation, and variational methods.

Parameter learning

In order to fully specify the Bayesian network and thus fully represent the joint probability distribution, it is necessary to specify for each node X the probability distribution for X conditional upon X's parents. The distribution of X conditional upon its parents may have any form. It is common to work with discrete or Gaussian distributions since that simplifies calculations. Sometimes only constraints on a distribution are known; one can then use the principle of maximum entropy to determine a single distribution, the one with the greatest entropy given the constraints. (Analogously, in the specific context of a dynamic Bayesian network, one commonly specifies the conditional distribution for the hidden state's temporal evolution to maximize the entropy rate of the implied stochastic process.)

Often these conditional distributions include parameters which are unknown and must be estimated from data, sometimes using the maximum likelihood approach. Direct maximization of the likelihood (or of the posterior probability) is often complex when there are unobserved variables. A classical approach to this problem is the expectation-maximization algorithm which alternates computing expected values of the unobserved variables conditional on observed data, with maximizing the complete likelihood (or posterior) assuming that previously computed expected values are correct. Under mild regularity conditions this process converges on maximum likelihood (or maximum posterior) values for parameters.

A more fully Bayesian approach to parameters is to treat parameters as additional unobserved variables and to compute a full posterior distribution over all nodes conditional upon observed data, then to integrate out the parameters. This approach can be expensive and lead to large dimension models, so in practice classical parameter-setting approaches are more common.

Structure learning

In the simplest case, a Bayesian network is specified by an expert and is then used to perform inference. In other applications the task of defining the network is too complex for humans. In this case the network structure and the parameters of the local distributions must be learned from data.

Automatically learning the graph structure of a Bayesian network is a challenge pursued within machine learning. The basic idea goes back to a recovery algorithm developed by Rebane and Pearl (1987)[6] and rests on the distinction between the three possible types of adjacent triplets allowed in a directed acyclic graph (DAG):

  1. X \rightarrow Y \rightarrow Z
  2. X \leftarrow Y \rightarrow Z
  3. X \rightarrow Y \leftarrow Z

Type 1 and type 2 represent the same dependencies (X and Z are independent given Y) and are, therefore, indistinguishable. Type 3, however, can be uniquely identified, since X and Z are marginally independent and all other pairs are dependent. Thus, while the skeletons (the graphs stripped of arrows) of these three triplets are identical, the directionality of the arrows is partially identifiable. The same distinction applies when X and Z have common parents, except that one must first condition on those parents. Algorithms have been developed to systematically determine the skeleton of the underlying graph and, then, orient all arrows whose directionality is dictated by the conditional independencies observed.[1][7][8][9]

An alternative method of structural learning uses optimization based search. It requires a scoring function and a search strategy. A common scoring function is posterior probability of the structure given the training data. The time requirement of an exhaustive search returning a structure that maximizes the score is superexponential in the number of variables. A local search strategy makes incremental changes aimed at improving the score of the structure. A global search algorithm like Markov chain Monte Carlo can avoid getting trapped in local minima. Friedman et al.[10][11] discuss using mutual information between variables and finding a structure that maximizes this. They do this by restricting the parent candidate set to k nodes and exhaustively searching therein.

Another method consists of focusing on the sub-class of decomposable models, for which the MLE have a closed form. It is then possible to discover a consistent structure for hundreds of variables.[12]

A Bayesian network can be augmented with nodes and edges using rule-based machine learning techniques. Inductive logic programming can be used to mine rules and create new nodes.[13] Statistical relational learning (SRL) approaches use a scoring function based on the Bayes network structure to guide the structural search and augment the network.[14] A common SRL scoring function is the area under the ROC curve.

Statistical introduction

Given data x\,\! and parameter \theta, a simple Bayesian analysis starts with a prior probability (prior) p(\theta) and likelihood p(x\mid\theta) to compute a posterior probability p(\theta\mid x) \propto p(x\mid\theta)p(\theta).

Often the prior on \theta depends in turn on other parameters \varphi that are not mentioned in the likelihood. So, the prior p(\theta) must be replaced by a likelihood p(\theta\mid \varphi), and a prior p(\varphi) on the newly introduced parameters \varphi is required, resulting in a posterior probability

p(\theta,\varphi|x) \propto p(x|\theta)p(\theta|\varphi)p(\varphi).

This is the simplest example of a hierarchical Bayes model.

The process may be repeated; for example, the parameters \varphi may depend in turn on additional parameters \psi\,\!, which will require their own prior. Eventually the process must terminate, with priors that do not depend on any other unmentioned parameters.

Introductory examples

Suppose we have measured the quantities x_1,\dots,x_n\,\!each with normally distributed errors of known standard deviation \sigma\,\!,

x_i \sim N(\theta_i, \sigma^2)

Suppose we are interested in estimating the \theta_i. An approach would be to estimate the \theta_i using a maximum likelihood approach; since the observations are independent, the likelihood factorizes and the maximum likelihood estimate is simply

\theta_i = x_i

However, if the quantities are related, so that for example we may think that the individual \theta_i have themselves been drawn from an underlying distribution, then this relationship destroys the independence and suggests a more complex model, e.g.,

x_i \sim N(\theta_i,\sigma^2),
\theta_i\sim N(\varphi, \tau^2)

with improper priors \varphi\simflat, \tau\simflat \in (0,\infty). When n\ge 3, this is an identified model (i.e. there exists a unique solution for the model's parameters), and the posterior distributions of the individual \theta_i will tend to move, or shrink away from the maximum likelihood estimates towards their common mean. This shrinkage is a typical behavior in hierarchical Bayes models.

Restrictions on priors

Some care is needed when choosing priors in a hierarchical model, particularly on scale variables at higher levels of the hierarchy such as the variable \tau\,\! in the example. The usual priors such as the Jeffreys prior often do not work, because the posterior distribution will be improper (not normalizable), and estimates made by minimizing the expected loss will be inadmissible.

Definitions and concepts

There are several equivalent definitions of a Bayesian network. For all the following, let G = (V,E) be a directed acyclic graph (or DAG), and let X = (Xv)vV be a set of random variables indexed by V.

Factorization definition

X is a Bayesian network with respect to G if its joint probability density function (with respect to a product measure) can be written as a product of the individual density functions, conditional on their parent variables:[15]

p (x) = \prod_{v \in V} p \left(x_v \,\big|\, x_{\operatorname{pa}(v)} \right)

where pa(v) is the set of parents of v (i.e. those vertices pointing directly to v via a single edge).

For any set of random variables, the probability of any member of a joint distribution can be calculated from conditional probabilities using the chain rule (given a topological ordering of X) as follows:[15]

\mathrm P(X_1=x_1, \ldots, X_n=x_n) = \prod_{v=1}^n \mathrm P \left(X_v=x_v \mid X_{v+1}=x_{v+1}, \ldots, X_n=x_n \right)

Compare this with the definition above, which can be written as:

\mathrm P(X_1=x_1, \ldots, X_n=x_n) = \prod_{v=1}^n \mathrm P (X_v=x_v \mid X_j=x_j for each X_j\, which is a parent of X_v\, )

The difference between the two expressions is the conditional independence of the variables from any of their non-descendants, given the values of their parent variables.

Local Markov property

X is a Bayesian network with respect to G if it satisfies the local Markov property: each variable is conditionally independent of its non-descendants given its parent variables:[16]

X_v \perp\!\!\!\perp X_{V \setminus \operatorname{de}(v)} \mid X_{\operatorname{pa}(v)} \quad\text{for all }v \in V

where de(v) is the set of descendants and V \ de(v) is the set of non-descendants of v.

This can also be expressed in terms similar to the first definition, as

\mathrm P(X_v=x_v \mid X_i=x_i for each X_i\, which is not a descendant of X_v\, ) = P(X_v=x_v \mid X_j=x_j for each X_j\, which is a parent of X_v\, )

Note that the set of parents is a subset of the set of non-descendants because the graph is acyclic.

Developing Bayesian networks

To develop a Bayesian network, we often first develop a DAG G such that we believe X satisfies the local Markov property with respect to G. Sometimes this is done by creating a causal DAG. We then ascertain the conditional probability distributions of each variable given its parents in G. In many cases, in particular in the case where the variables are discrete, if we define the joint distribution of X to be the product of these conditional distributions, then X is a Bayesian network with respect to G.[17]

Markov blanket

The Markov blanket of a node is the set of nodes consisting of its parents, its children, and any other parents of its children. This set renders it independent of the rest of the network; the joint distribution of the variables in the Markov blanket of a node is sufficient knowledge for calculating the distribution of the node. X is a Bayesian network with respect to G if every node is conditionally independent of all other nodes in the network, given its Markov blanket.[16]


This definition can be made more general by defining the "d"-separation of two nodes, where d stands for directional.[18][19] Let P be a trail (that is, a collection of edges which is like a path, but each of whose edges may have any direction) from node u to v. Then P is said to be d-separated by a set of nodes Z if and only if (at least) one of the following holds:

  1. P contains a chain, umv, such that the middle node m is in Z,
  2. P contains a fork, umv, such that the middle node m is in Z, or
  3. P contains an inverted fork (or collider), umv, such that the middle node m is not in Z and no descendant of m is in Z.

Thus u and v are said to be d-separated by Z if all trails between them are d-separated. If u and v are not d-separated, they are called d-connected.

X is a Bayesian network with respect to G if, for any two nodes u, v:

X_u \perp\!\!\!\perp X_v \mid X_Z

where Z is a set which d-separates u and v. (The Markov blanket is the minimal set of nodes which d-separates node v from all other nodes.)

Hierarchical models

The term hierarchical model is sometimes considered a particular type of Bayesian network, but has no formal definition. Sometimes the term is reserved for models with three or more levels of random variables; other times, it is reserved for models with latent variables. In general, however, any moderately complex Bayesian network is usually termed "hierarchical".

Causal networks

Although Bayesian networks are often used to represent causal relationships, this need not be the case: a directed edge from u to v does not require that Xv is causally dependent on Xu. This is demonstrated by the fact that Bayesian networks on the graphs:

a \longrightarrow b \longrightarrow c \qquad \text{and} \qquad a \longleftarrow b \longleftarrow c

are equivalent: that is they impose exactly the same conditional independence requirements.

A causal network is a Bayesian network with an explicit requirement that the relationships be causal. The additional semantics of the causal networks specify that if a node X is actively caused to be in a given state x (an action written as do(X = x)), then the probability density function changes to the one of the network obtained by cutting the links from the parents of X to X, and setting X to the caused value x.[1] Using these semantics, one can predict the impact of external interventions from data obtained prior to intervention.

Inference complexity and approximation algorithms

In 1990 while working at Stanford University on large bioinformatic applications, David Cooper proved that exact inference in Bayesian networks is NP-hard.[20] This result prompted a surge in research on approximation algorithms with the aim of developing a tractable approximation to probabilistic inference. In 1993, Paul Dagum and Michael Luby proved two surprising results on the complexity of approximation of probabilistic inference in Bayesian networks.[21] First, they proved that there is no tractable deterministic algorithm that can approximate probabilistic inference to within an absolute error ɛ< 1/2. Second, they proved that there is no tractable randomized algorithm that can approximate probabilistic inference to within an absolute error ɛ < 1/2 with confidence probability greater than 1/2.

In practical terms, these complexity results suggested that while Bayesian networks were rich representations for AI and machine learning applications, their use in large real-world applications would need to be tempered by either topological structural constraints, such as naïve Bayes networks, or by restrictions on the conditional probabilities. The bounded variance algorithm[22] was the first provable fast approximation algorithm to efficiently approximate probabilistic inference in Bayesian networks with guarantees on the error approximation. This powerful algorithm required the minor restriction on the conditional probabilities of the Bayesian network to be bounded away from zero and one by 1/p(n) where p(n) was any polynomial on the number of nodes in the network n.


Bayesian networks are used for modelling beliefs in computational biology and bioinformatics (gene regulatory networks, protein structure, gene expression analysis,[23] learning epistasis from GWAS data sets[24]) medicine,[25] biomonitoring,[26] document classification, information retrieval,[27] semantic search,[28] image processing, data fusion, decision support systems,[29] engineering, sports betting,[30][31] gaming, law,[32][33][34] study design[35] and risk analysis.[36][37][38] There are texts applying Bayesian networks to bioinformatics[39] and financial and marketing informatics.[40]


  • WinBUGS
  • OpenBUGS (website), further (open source) development of WinBUGS.
  • Direct Graphical Models (DGM) is an open source C++ library, implementing various tasks in probabilistic graphical models with pairwise dependencies.
  • OpenMarkov, open source software and API implemented in Java
  • Graphical Models Toolkit (GMTK) — GMTK is an open source, publicly available toolkit for rapidly prototyping statistical models using dynamic graphical models (DGMs) and dynamic Bayesian networks (DBNs). GMTK can be used for applications and research in speech and language processing, bioinformatics, activity recognition, and any time series application.
  • Just another Gibbs sampler (JAGS) (website)
  • Stan (software) (website) — Stan is an open-source package for obtaining Bayesian inference using the No-U-Turn sampler, a variant of Hamiltonian Monte Carlo. It’s somewhat like BUGS, but with a different language for expressing models and a different sampler for sampling from their posteriors. RStan is the R interface to Stan.
  • PyMC — PyMC is a python module that implements Bayesian statistical models and fitting algorithms, including Markov chain Monte Carlo. Its flexibility and extensibility make it applicable to a large suite of problems. Along with core sampling functionality, PyMC includes methods for summarizing output, plotting, goodness-of-fit and convergence diagnostics.
  • GeNIe&Smile (website) — SMILE is a C++ library for BN and ID, and GeNIe is a GUI for it
  • SamIam (website), a Java-based system with GUI and Java API
  • Bayes Server - User Interface and API for Bayesian networks, includes support for time series and sequences
  • Belief and Decision Networks on AIspace
  • BayesiaLab by Bayesia
  • Hugin
  • Netica by Norsys
  • dVelox by Apara Software
  • System Modeler by Inatas AB
  • UnBBayes by GIA-UnB (Intelligence Artificial Group - University of Brasilia)


The term "Bayesian networks" was coined by Judea Pearl in 1985 to emphasize three aspects:[41]

  1. The often subjective nature of the input information.
  2. The reliance on Bayes' conditioning as the basis for updating information.
  3. The distinction between causal and evidential modes of reasoning, which underscores Thomas Bayes' posthumously published paper of 1763.[42]

In the late 1980s Judea Pearl's text Probabilistic Reasoning in Intelligent Systems[43] and Richard E. Neapolitan's text Probabilistic Reasoning in Expert Systems[44] summarized the properties of Bayesian networks and established Bayesian networks as a field of study.

Informal variants of such networks were first used by legal scholar John Henry Wigmore, in the form of Wigmore charts, to analyse trial evidence in 1913.[33]:66–76 Another variant, called path diagrams, was developed by the geneticist Sewall Wright[45] and used in social and behavioral sciences (mostly with linear parametric models).

See also


  1. ^ a b c d  
  2. ^ "The Back-Door Criterion" (PDF). Retrieved 2014-09-18. 
  3. ^ "d-Separation without Tears" (PDF). Retrieved 2014-09-18. 
  4. ^ J., Pearl (1994). "A Probabilistic Calculus of Actions". In Lopez de Mantaras, R.; Poole, D. UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence. San Mateo CA: Morgan Kaufman. pp. 454–462.  
  5. ^ I. Shpitser, J. Pearl, "Identification of Conditional Interventional Distributions" In R. Dechter and T.S. Richardson (Eds.), Proceedings of the Twenty-Second Conference on Uncertainty in Artificial Intelligence, 437–444, Corvallis, OR: AUAI Press, 2006.
  6. ^ Rebane, G. and Pearl, J., "The Recovery of Causal Poly-trees from Statistical Data," Proceedings, 3rd Workshop on Uncertainty in AI, (Seattle, WA) pages 222–228, 1987
  7. ^ Spirtes, P.; Glymour, C. (1991). "An algorithm for fast recovery of sparse causal graphs" (PDF). Social Science Computer Review 9 (1): 62–72.  
  8. ^ Spirtes, Peter; Glymour, Clark N.; Scheines, Richard (1993). Causation, Prediction, and Search (1st ed.). Springer-Verlag.  
  9. ^ Verma, Thomas; Pearl, Judea (1991). "Equivalence and synthesis of causal models". In Bonissone, P.; Henrion, M.; Kanal, L.N.; Lemmer, J.F. UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence. Elsevier. pp. 255–270.  
  10. ^ Friedman, Nir; Geiger, Dan; Goldszmidt, Moises (November 1997). "Bayesian Network Classifiers". Machine Learning 29 (2-3): 131–163.  
  11. ^ Friedman, Nir; Linial, Michal; Nachman, Iftach; Pe'er, Dana (August 2000). "Using Bayesian Networks to Analyze Expression Data". Journal of Computational Biology 7 (3-4): 601–620.  
  12. ^ Petitjean, F.; Webb, G.I.; Nicholson, A.E. (2013). Scaling log-linear analysis to high-dimensional data (PDF). International Conference on Data Mining. Dallas, TX, USA: IEEE. 
  13. ^ Nassif, Houssam; Wu, Yirong; Page, David; Burnside, Elizabeth (2012). "Logical Differential Prediction Bayes Net, Improving Breast Cancer Diagnosis for Older Women" (PDF). American Medical Informatics Association Symposium (AMIA'12) (Chicago): 1330–1339. Retrieved 18 July 2014. 
  14. ^ Nassif, Houssam; Kuusisto, Finn; Burnside, Elizabeth S; Page, David; Shavlik, Jude; Santos Costa, Vitor (2013). "Score As You Lift (SAYL): A Statistical Relational Learning Approach to Uplift Modeling" (PDF). European Conference on Machine Learning (ECML'13) (Prague): 595–611. 
  15. ^ a b Russell & Norvig 2003, p. 496.
  16. ^ a b Russell & Norvig 2003, p. 499.
  17. ^ Neapolitan, Richard E. (2004). Learning Bayesian networks. Prentice Hall.  
  18. ^ Geiger, Dan; Verma, Thomas; Pearl, Judea (1990). "Identifying independence in Bayesian Networks" (PDF). Networks 20: 507–534.  
  19. ^ Richard Scheines, D-separation 
  20. ^ [3]  
  21. ^ [4]  
  22. ^ []  
  23. ^ Friedman, N.; Linial, M.; Nachman, I.; Pe'er, D. (2000). "Using Bayesian Networks to Analyze Expression Data". Journal of Computational Biology 7 (3–4): 601–620.  
  24. ^ Jiang, X.; Neapolitan, R.E.; Barmada, M.M.; Visweswaran, S. (2011). "Learning Genetic Epistasis using Bayesian Network Scoring Criteria". BMC Bioinformatics 12: 89.  
  25. ^ J. Uebersax (2004). Genetic Counseling and Cancer Risk Modeling: An Application of Bayes Nets. Marbella, Spain: Ravenpack International. 
  26. ^ Jiang X, Cooper GF. (July–August 2010). "A Bayesian spatio-temporal method for disease outbreak detection". J Am Med Inform Assoc 17 (4): 462–71.  
  27. ^ Luis M. de Campos, Juan M. Fernández-Luna and Juan F. Huete (2004). "Bayesian networks and information retrieval: an introduction to the special issue". Information Processing & Management (Elsevier) 40 (5): 727–733.  
  28. ^ Christos L. Koumenides and Nigel R. Shadbolt. 2012. Combining link and content-based information in a Bayesian inference model for entity search. In Proceedings of the 1st Joint International Workshop on Entity-Oriented and Semantic Search (JIWES '12). ACM, New York, NY, USA, , Article 3 , 6 pages. doi:10.1145/2379307.2379310
  29. ^ F.J. Díez, J. Mira, E. Iturralde and S. Zubillaga (1997). "DIAVAL, a Bayesian expert system for echocardiography". Artificial Intelligence in Medicine (Elsevier) 10 (1): 59–73.  
  30. ^ Constantinou, Anthony; Fenton, N.; Neil, M. (2012). "pi-football: A Bayesian network model for forecasting Association Football match outcomes". Knowledge-Based Systems 36: 322–339.  
  31. ^ Constantinou, Anthony; Fenton, N.; Neil, M. (2013). "Profiting from an inefficient Association Football gambling market: Prediction, Risk and Uncertainty using Bayesian networks.". Knowledge-Based Systems 50: 60–86.  
  32. ^ G. A. Davis (2003). "Bayesian reconstruction of traffic accidents". Law, Probability and Risk 2 (2): 69–89.  
  33. ^ a b J. B. Kadane and D. A. Schum (1996). A Probabilistic Analysis of the Sacco and Vanzetti Evidence. New York: Wiley.  
  34. ^ O. Pourret, P. Naim and B. Marcot (2008). Bayesian Networks: A Practical Guide to Applications. Chichester, UK: Wiley.  
  35. ^ Karvanen, Juha (2014). "Study design in causal models". Scandinavian Journal of Statistics.  
  36. ^ Cardenas, IC; Al-Jibouri, SHS; Halman, JIM; van Tol, FA (2014). "Modeling Risk-Related Knowledge in Tunneling Projects". Risk Analysis 34 (2): 323–339.  
  37. ^ Cardenas, IC; Al-Jibouri, SHS; Halman, JIM; van de Linde, W; Kaalberg, F (2014). "Using Prior Risk-Related Knowledge to Support Risk Management Decisions: Lessons Learnt from a Tunneling Project". Risk Analysis 34 (8).  
  38. ^ Cardenas, IC (2015). "Modeling the Influence of Unknown Factors in Risk Analysis Using Bayesian Networks". Under review by a refereed journal. 
  39. ^ Neapolitan, Richard (2009). Probabilistic Methods for Bioinformatics. Burlington, MA: Morgan Kaufmann. p. 406.  
  40. ^ Neapolitan, Richard, and Xia Jiang (2007). Probabilistic Methods for Financial and Marketing Informatics. Burlingon, MA: Morgan Kaufmann. p. 432.  
  41. ^  
  42. ^  
  43. ^ Pearl, J. Probabilistic Reasoning in Intelligent Systems. San Francisco CA: Morgan Kaufmann. p. 1988.  
  44. ^ Neapolitan, Richard E. (1989). Probabilistic reasoning in expert systems: theory and algorithms. Wiley.  
  45. ^  


  • Ben-Gal, Irad (2007). "Bayesian Networks". In Ruggeri, Fabrizio; Kennett, Ron S.; Faltin, Frederick W. Encyclopedia of Statistics in Quality and Reliability (PDF). Encyclopedia of Statistics in Quality and Reliability.  
  • Bertsch McGrayne, Sharon. The Theory That Would not Die.  
  • Borgelt, Christian; Kruse, Rudolf (March 2002). Graphical Models: Methods for Data Analysis and Mining.  
  • Borsuk, Mark Edward (2008). "Ecological informatics: Bayesian networks". In  
  • Cardenas, I.; et al. (April 2015). "Modeling the Influence of Unknown Factors in Risk Analysis using Bayesian Networks" (PDF). Under review by a refereed journal. 
  • Castillo, Enrique; Gutiérrez, José Manuel; Hadi, Ali S. (1997). "Learning Bayesian Networks". Expert Systems and Probabilistic Network Models. Monographs in computer science. New York:  
  • Comley, Joshua W.; Dowe, David L. (June 2003). "General Bayesian networks and asymmetric languages". Proceedings of the 2nd Hawaii International Conference on Statistics and Related Fields ( 
  • Comley, Joshua W.; Dowe, David L. (2005). "Minimum Message Length and Generalized Bayesian Nets with Asymmetric Languages". In Grünwald, Peter D.; Myung, In Jae; Pitt, Mark A. Advances in Minimum Description Length: Theory and Applications. Neural information processing series. ). Camera-ready final version submitted on 15 October 2003. An earlier version is Comley and Dowe (2003), .pdf.) MML in internal nodes of Bayes networks using Minimum Message Length (decision trees (This paper puts  
  • Darwiche, Adnan (2009). Modeling and Reasoning with Bayesian Networks.  
  • Dowe, David L. (2010). MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness, in Handbook of Philosophy of Science (Volume 7: Handbook of Philosophy of Statistics), Elsevier, ISBN 978-0-444-51862-0, pp 901–982.
  • Fenton, Norman; Neil, Martin E. (November 2007). Managing Risk in the Modern World: Applications of Bayesian Networks – A Knowledge Transfer Report from the London Mathematical Society and the Knowledge Transfer Network for Industrial Mathematics. London (England): London Mathematical Society.
  • Fenton, Norman; Neil, Martin E. (July 23, 2004). "Combining evidence in risk analysis using Bayesian Networks" (PDF). Safety Critical Systems Club Newsletter 13 (4) ( 
  • Andrew Gelman; John B Carlin; Hal S Stern; Donald B Rubin (2003). "Part II: Fundamentals of Bayesian Data Analysis: Ch.5 Hierarchical models". Bayesian Data Analysis. CRC Press. pp. 120–.  
  • Heckerman, David (March 1, 1995). "Tutorial on Learning with Bayesian Networks". In Jordan, Michael Irwin. Learning in Graphical Models. Adaptive Computation and Machine Learning. .  
Also appears as Heckerman, David (March 1997). "Bayesian Networks for Data Mining".  
An earlier version appears as Technical Report MSR-TR-95-06, Microsoft Research, March 1, 1995. The paper is about both parameter and structure learning in Bayesian networks.
  • Jensen, Finn V; Nielsen, Thomas D. (June 6, 2007). Bayesian Networks and Decision Graphs. Information Science and Statistics series (2nd ed.).  
  • Karimi, Kamran; Hamilton, Howard J. (2000). "Finding temporal relations: Causal bayesian networks vs. C4. 5" (PDF). Twelfth International Symposium on Methodologies for Intelligent Systems. 
  • Korb, Kevin B.; Nicholson, Ann E. (December 2010). Bayesian Artificial Intelligence. CRC Computer Science & Data Analysis (2nd ed.).  
  • Lunn, D.; Thomas, A; Best, N; et al. (2009). "The BUGS project: Evolution, critique and future directions". Statistics in Medicine 28 (25): 3049–3067.  
  • Neil, Martin; Fenton, Norman E.; Tailor, Manesh (August 2005). Greenberg, Michael R., ed. "Using Bayesian Networks to Model Expected and Unexpected Operational Losses" (pdf).  
  • .  
  • Zhang, Nevin Lianwen; Poole, David (May 1994). "A simple approach to Bayesian network computations". Proceedings of the Tenth Biennial   This paper presents variable elimination for belief networks.

Further reading

  • Computational Intelligence: A Methodological Introduction by Kruse, Borgelt, Klawonn, Moewes, Steinbrecher, Held, 2013, Springer, ISBN 9781447150121
  • Graphical Models - Representations for Learning, Reasoning and Data Mining, 2nd Edition, by Borgelt, Steinbrecher, Kruse, 2009, J. Wiley & Sons, ISBN 9780470749562

External links

  • A tutorial on learning with Bayesian Networks
  • An Introduction to Bayesian Networks and their Contemporary Applications
  • On-line Tutorial on Bayesian nets and probability
  • Web-App to create Bayesian nets and run it with a Monte Carlo method
  • Continuous Time Bayesian Networks
  • Bayesian Networks: Explanation and Analogy
  • A live tutorial on learning Bayesian networks
  • A hierarchical Bayes Model for handling sample heterogeneity in classification problems, provides a classification model taking into consideration the uncertainty associated with measuring replicate samples.
  • Hierarchical Naive Bayes Model for handling sample uncertainty, shows how to perform classification and learning with continuous and discrete variables with replicated measurements.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from World Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.