Math 2.0

Statistics Definition

Bayesian network

Builds on Graphical modelDirected graphConditional probability distributionConditional independence

Definition

Let G=(V,E)G = (V, E) be a finite directed graph with no directed cycles, that is, a directed acyclic graph. For v∈Vv \in V let pa⁡(v)\operatorname{pa}(v) be the set of parents of vv, the vertices uu with an edge u→vu \to v. Let X=(Xv)v∈VX = (X_v)_{v \in V} be random variables with a joint density or probability mass function pp. Then XX is a Bayesian network with respect to GG if p(x)=∏v∈Vp(xv∣xpa⁡(v))p(x) = \prod_{v \in V} p(x_v \mid x_{\operatorname{pa}(v)}) for all xx, where p(xv∣xpa⁡(v))p(x_v \mid x_{\operatorname{pa}(v)}) is the conditional density of XvX_v given Xpa⁡(v)X_{\operatorname{pa}(v)}.

Remarks

The factorisation is equivalent to the local Markov property. Each XvX_v is conditionally independent of its non-descendants given its parents. Example: for the chain A→B→CA \to B \to C, the definition asks p(a,b,c)=p(a)p(b∣a)p(c∣b)p(a, b, c) = p(a) p(b \mid a) p(c \mid b). Dividing by p(b)p(b) gives p(a,c∣b)=p(a∣b)p(c∣b)p(a, c \mid b) = p(a \mid b) p(c \mid b), so A⊥C∣BA \perp C \mid B. Non-example: the graph A→B→AA \to B \to A has a directed cycle, so it does not define a Bayesian network; a product p(a∣b)p(b∣a)p(a \mid b) p(b \mid a) is in general not a joint distribution. Different graphs can give the same model: A→B→CA \to B \to C and A←B←CA \leftarrow B \leftarrow C both encode exactly A⊥C∣BA \perp C \mid B.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Conditional independence concept
  2. Conditional probability distribution concept
  3. Directed graph concept
  4. Graphical model concept
  5. Bayesian network definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Bayesian_network
About this page
TagG2XY7J2Z5Q
URIm2://G2XY7J2Z5Q
Kinddefinition
WritingW0 stub
MSC62H22, 68T37
DefinesBayesian network
UsesGraphical model, Directed graph, Conditional probability distribution, Conditional independence

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.