Decomposition of two classes of structural models
From MaRDI portal
Publication:2514003
DOI10.1007/s11464-013-0289-7zbMath1314.62125OpenAlexW2078286247MaRDI QIDQ2514003
Publication date: 29 January 2015
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-013-0289-7
decompositiondirected acyclic graphundirected graphconditional independence modelcombinatorial imset
Characterization and structure theory for multivariate probability distributions; copulas (62H05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on minimal d-separation trees for structural learning
- A geometric view on learning Bayesian network structures
- Logical and algorithmic properties of conditional independence and graphical models
- Conditional independence in valuation-based systems
- Towards classification of semigraphoids.
- Marginalization and collapsibility in graphical interaction models
- Optimal decomposition by clique separators
- Decomposition of structural learning about directed acyclic graphs
- Finding the minimal set for collapsible graphical models
- Collapsibility and response variables in contingency tables
- Probabilistic Networks and Expert Systems
- Conditional Independences among Four Random Variables III: Final Conclusion
- Introduction to Graphical Modelling
- Independence properties of directed markov fields
This page was built for publication: Decomposition of two classes of structural models