Moral graph

From Wikipedia, the free encyclopedia

A moral graph is a concept in graph theory, used to find the equivalent form undirected form of a directed acyclic graph. It is a key step of the junction tree algorithm, used in belief propagation on graphical models.

The moralized counterpart of a directed acyclic graph which is formed by connecting nodes that have a common child, and then making all edges in the graph undirected. The name stems from the fact the two node that have a common child are said to be married. Equivalently, a moral graph of a directed acyclic graph G is an undirected graph in which each node of the original G is now connected to its Markov blanket.

The correpsonding moral graph. The newly added arcs are shown in red in the moralized graph.
The correpsonding moral graph. The newly added arcs are shown in red in the moralized graph.

[edit] See also

[edit] References