In graph theory, a moral graph is 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. Moralization may also be applied to mixed graphs, called in this context "chain graphs". In a chain graph, a connected component of the undirected subgraph is called a chain. Moralization adds an undirected edge between any two vertices that both have outgoing edges to the same chain, and then forgets the orientation of the directed edges of the graph.
| Attributes | Values |
|---|
| type
| |
| sameAs
| |
| wasDerivedFrom
| |
| dbpedia-owl:abstract
| - In graph theory, a moral graph is 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 adding edges between all pairs of non-adjacent 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. Moralization may also be applied to mixed graphs, called in this context "chain graphs". In a chain graph, a connected component of the undirected subgraph is called a chain. Moralization adds an undirected edge between any two vertices that both have outgoing edges to the same chain, and then forgets the orientation of the directed edges of the graph.
- У теорії графів моральний граф використовують для пошуку еквівалентного неорієнтованого графа для спрямовного ациклічного графа. Це ключовий крок , використовуваного в на графових імовірнісних моделях.
- В теории графов моральный граф используется для поиска эквивалентного неориентированного графа для направленного ациклического графа. Это ключевой шаг алгоритма для дерева сочленений, используемого в алгоритме распространения доверия на графовых вероятностных моделях.
- La moralisation d'un graphe consiste à passer d'un graphe orienté à un graphe non orienté dont les parents d'un même sommet sont liés par une arête. Certains algorithmes nécessitent en effet de disposer d'un tel graphe.
|
| dbpedia-owl:thumbnail
| |
| dbpedia-owl:wikiPageExternalLink
| |
| dbpedia-owl:wikiPageID
| |
| dbpedia-owl:wikiPageRevisionID
| |
| dbpprop:align
| |
| dbpprop:caption
| - A directed acyclic graph
- The corresponding moral graph, with newly added arcs shown in red
|
| dbpprop:image
| - MoralGraph-DAG1.svg
- Moralized graph1.svg
|
| comment
| - In graph theory, a moral graph is 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. Moralization may also be applied to mixed graphs, called in this context "chain graphs". In a chain graph, a connected component of the undirected subgraph is called a chain. Moralization adds an undirected edge between any two vertices that both have outgoing edges to the same chain, and then forgets the orientation of the directed edges of the graph.
- У теорії графів моральний граф використовують для пошуку еквівалентного неорієнтованого графа для спрямовного ациклічного графа. Це ключовий крок , використовуваного в на графових імовірнісних моделях.
- В теории графов моральный граф используется для поиска эквивалентного неориентированного графа для направленного ациклического графа. Это ключевой шаг алгоритма для дерева сочленений, используемого в алгоритме распространения доверия на графовых вероятностных моделях.
- La moralisation d'un graphe consiste à passer d'un graphe orienté à un graphe non orienté dont les parents d'un même sommet sont liés par une arête. Certains algorithmes nécessitent en effet de disposer d'un tel graphe.
|
| label
| - Moral graph
- Moralisation de graphe
- Моральний граф
- Моральный граф
|
| dbpprop:wikiPageUsesTemplate
| |
| described by
| |
| topic
| |
| depiction
| |
| Subject
| |
| is primary topic of
| |
| dbpedia-owl:wikiPageLength
| |
| dbpedia-owl:wikiPageWikiLink
| |
| is sameAs
of | |
| is topic
of | |
| is primary topic
of | |
| is dbpedia-owl:wikiPageWikiLink
of | |
| is inDataset
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
