Content deleted Content added
No edit summary |
m clean up using AWB |
||
Line 1:
In [[probability theory]] and [[statistics]], a '''graphical model (GM)''' represents [[statistical independence|dependencies]] among [[random variable
In the simplest case, the network structure of the model is a [[directed acyclic graph]] (DAG). Then the GM represents a factorization of the joint [[probability]] of all random variables. More precisely, if the events are
Line 15:
In other words, the [[probability distribution|joint distribution]] factors into a product of conditional distributions. The graph structure indicates direct dependencies among random variables. Any two nodes that are not in a descendant/ancestor relationship are [[Conditional independence|conditionally independent]] given the values of their parents.
This type of graphical model is known as a directed graphical model, [[Bayesian network]], or belief network. Classic [[
Graphical models with undirected edges are generally called [[
Applications of graphical models include modelling of [[gene regulatory network]]s, [[
A good reference for learning the basics of graphical models is written by Neapolitan, Learning Bayesian networks (2004). A more advanced and statistically oriented book is by Cowell, Dawid, Lauritzen and Spiegelhalter, Probabilistic networks and expert systems (1999). See also [[belief propagation]].
Line 30:
[[Category:Bayesian networks]]
[[Category:Statistics]]
[[es:Modelo en grafo]]
|