Bayesian network
Builds on Graphical modelDirected graphConditional probability distributionConditional independence
Definition
Let be a finite directed graph with no directed cycles, that is, a directed acyclic graph. For let be the set of parents of , the vertices with an edge . Let be random variables with a joint density or probability mass function . Then is a Bayesian network with respect to if for all , where is the conditional density of given .
Remarks
The factorisation is equivalent to the local Markov property. Each is conditionally independent of its non-descendants given its parents. Example: for the chain , the definition asks . Dividing by gives , so . Non-example: the graph has a directed cycle, so it does not define a Bayesian network; a product is in general not a joint distribution. Different graphs can give the same model: and both encode exactly .
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
- no evidence level
- Conditional independence concept
- Conditional probability distribution concept
- Directed graph concept
- Graphical model concept
- Bayesian network definition
Further reading
About this page
| Tag | G2XY7J2Z5Q |
|---|---|
| URI | m2://G2XY7J2Z5Q |
| Kind | definition |
| Writing | W0 stub |
| MSC | 62H22, 68T37 |
| Defines | Bayesian network |
| Uses | Graphical 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.