# Graphical model

## Redirected from Probabilistic graphical model

*34,203*pages on

this wiki

Assessment |
Biopsychology |
Comparative |
Cognitive |
Developmental |
Language |
Individual differences |
Personality |
Philosophy |
Social |

Methods |
Statistics |
Clinical |
Educational |
Industrial |
Professional items |
World psychology |

**Statistics:**
Scientific method ·
Research methods ·
Experimental design ·
Undergraduate statistics courses ·
Statistical tests ·
Game theory ·
Decision theory

In probability theory, statistics, and machine learning, a **graphical model (GM)** is a graph that represents independencies among random variables by a graph in which each node is a random variable, and the missing edges between the nodes represent conditional independencies.

Two common types of GMs correspond to graphs with directed and undirected edges. If the network structure of the model is a directed acyclic graph (DAG), the GM represents a factorization of the joint probability of all random variables. More precisely, if the events are

*X*_{1}, ...,*X*_{n},

then the joint probability

*P*(*X*_{1}, ...,*X*_{n}),

is equal to the product of the conditional probabilities

- P(
*X*| parents of_{i}*X*) for_{i}*i*= 1,...,*n*.

In other words, the joint distribution factors into a product of conditional distributions. Any two nodes that are not connected by an arrow are conditionally independent given the values of their parents. In general, any two sets of nodes are conditionally
independent given a third set if a criterion called *d*-separation holds in the graph. It will turn out that the local independencies and global independecies are equivalent in Bayesian networks.

This type of graphical model is known as a directed graphical model, Bayesian network, or belief network. Classic machine learning models like hidden Markov models, neural networks and newer models such as variable-order Markov models can be considered as special cases of Bayesian networks.

Graphical models with undirected edges are generally called Markov random fields or Markov networks.

A third type of graphical model is a factor graph, which is an undirected bipartite graph connecting variables and *factor nodes*. Each factor represents a probability distribution over the variables it is connected to. In contrast to a Bayesian network, a factor may be connected to more than two nodes.

Applications of graphical models include speech recognition, computer vision, decoding of low-density parity-check codes, modeling of gene regulatory networks, gene finding and diagnosis of diseases.

A good reference for learning the basics of graphical models is written by Neapolitan, *Learning Bayesian networks* (2004) and another is Finn Verner Jensen's *An Introduction to Bayesian Networks* from 1996.^{[1]}
A more advanced and statistically oriented book is by Cowell, Dawid, Lauritzen and Spiegelhalter, *Probabilistic networks and expert systems* (1999).

A computational reasoning approach is provided in Judea Pearl's *Probabilistic Reasoning in Intelligent Systems* from 1988^{[2]} where the relationships between graphs and
probabilities were formally introduced.

## See alsoEdit

## ReferencesEdit

- ↑ Finn Verner Jensen (1996).
*An Introduction to Bayesian Networks*, New York: Springer Verlag. - ↑ Judea Pearl (1988).
*Probabilistic Reasoning in Intelligent Systems*, Revised Second Printing, San Mateo, CA: Morgan Kaufmann.

### Others Edit

- Graphical models, Chapter 8 of Pattern Recognition and Machine Learning by Christopher M. Bishop
- A Brief Introduction to Graphical Models and Bayesian Networks
- Heckerman's Bayes Net Learning Tutorial
- Edoardo M. Airoldi (2007). Getting Started in Probabilistic Graphical Models.
*PLoS Computational Biology***3**(12): e252.

This page uses Creative Commons Licensed content from Wikipedia (view authors). |