A moral graph is a concept in graph theory, used to find the equivalent 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 is formed by connecting nodes that have a common child, and then making all edges in the graph undirected. 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 name stems from the fact that, in a moral graph, two nodes that have a common child are required to be married by sharing an edge.
Famous quotes containing the words moral and/or graph:
“When we start deceiving ourselves into thinking not that we want something or need something, not that it is a pragmatic necessity for us to have it, but that it is a moral imperative that we have it, then is when we join the fashionable madmen, and then is when the thin whine of hysteria is heard in the land, and then is when we are in bad trouble.”
—Joan Didion (b. 1934)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)