Editing Graphical model (section)

===Other types===
*[[Dependency network (graphical model)|Dependency network]]  where cycles are allowed
*Tree-augmented classifier or '''TAN model'''
[[File:Tan corral.png|thumb| TAN model for "corral dataset".]]
*Targeted Bayesian network learning (TBNL) [[File:Tbnl corral.jpg|thumb|TBNL model for "corral dataset"]]
*A [[factor graph]] is an undirected [[bipartite graph]] connecting variables and factors. Each factor represents a function over the variables it is connected to. This is a helpful representation for understanding and implementing [[belief propagation]].
* A [[clique tree]] or junction tree is a [[tree (graph theory)|tree]] of [[clique (graph theory)|cliques]], used in the [[junction tree algorithm]].
* A [[chain graph]] is a graph which may have both directed and undirected edges, but without any directed cycles (i.e. if we start at any vertex and move along the graph respecting the directions of any arrows, we cannot return to the vertex we started from if we have passed an arrow). Both directed acyclic graphs and undirected graphs are special cases of chain graphs, which can therefore provide a way of unifying and generalizing Bayesian and Markov networks.<ref>{{cite journal|last=Frydenberg|first=Morten|year=1990|title=The Chain Graph Markov Property|journal=[[Scandinavian Journal of Statistics]]|volume=17|issue=4|pages=333–353|mr=1096723|jstor=4616181 }}
</ref>
* An [[ancestral graph]] is a further extension, having directed, bidirected and undirected edges.<ref>{{cite journal
 |first1=Thomas |last1=Richardson |first2=Peter |last2=Spirtes
 |title=Ancestral graph Markov models
 |journal=[[Annals of Statistics]]
 |volume=30 |issue=4 |year=2002 |pages=962–1030
 |doi=10.1214/aos/1031689015
 |mr=1926166 | zbl = 1033.60008
|citeseerx=10.1.1.33.4906}}</ref>
* [[Random field]] techniques
** A [[Markov random field]], also known as a Markov network, is a model over an [[undirected graph]]. A graphical model with many repeated subunits can be represented with [[plate notation]].
** A [[conditional random field]] is a [[discriminative model]] specified over an undirected graph.
* A [[restricted Boltzmann machine]] is a [[Bipartite graph|bipartite]] [[generative model]] specified over an undirected graph.