Graphical Model

In probability theory and statistics, a graphical model (GM) represents dependencies among random variables by a graph in which each random variable is a node. 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
X1, ..., Xn,
then the joint probability
P(X1, ..., Xn),
is equal to the product of the conditional probabilities
P(Xi | parents of Xi) for i = 1,...,n.
In other words, the 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 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. There are also undirected graphical models, a.k.a. Markov networks, in which graph separation encodes conditional independencies.

 

<< PreviousWord BrowserNext >>
animation:master
battle of gully ravine
conrad
concrete illustration of the central limit theorem
john ponsonby, 4th earl of bessborough
earl of march
didymus the musician
the icicle thief
lawrence watt evans
david collenette
u.s. highway 2
escort agency
iron man (disambiguation)
township (canada)
township (england)
object relationship modeling
township (south africa)
cyclopean isles
township (united states)
thranx
milan babic
writing on the wall
project athena
studio 2
east coast main line
list of museums in the united states
from dusk till dawn
cheech marin
arpachshad
thyroxine binding globulin
twin city rapid transit
revaz dogonadze
snivitz
clifford
battle of karkar
einojuhani rautavaara
capital good
tactics ogre
block printing
permanent deacon
palatine chapel
azad
list of former german colonies
nazi concentration camp badges