Marginalizing and conditioning in graphical models (Q1860998)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1877112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Marginalizing and conditioning in graphical models |
scientific article; zbMATH DE number 1877112 |
Statements
Marginalizing and conditioning in graphical models (English)
0 references
25 May 2003
0 references
The author introduces the class of MC graphs and shows that it is closed under the operations of marginalizing over a certain subset of vertices, or conditioning on a subset of other vertices. The present paper addresses the marginalization and conditioning problem for a large class of graphs, containing at least all undirected graphs and all directional graphs. Directional graphs are important, since they occur as path diagrams in Gaussian linear structural equation systems.
0 references
Gaussian linear equation systems
0 references
graph
0 references
graphical Markov model
0 references
linear structural equation systems
0 references
Markov property
0 references
Markov random field
0 references
MC graph
0 references
non-recursive casual model
0 references
separation
0 references
0.8350927829742432
0 references
0.828916072845459
0 references
0.8093278408050537
0 references
0.7916618585586548
0 references
