Computing concise representations of semi-graphoid independency models
From MaRDI portal
Recommendations
- Concise representations and construction algorithms for semi-graphoid independency models
- Exploiting independencies to compute semigraphoid and graphoid structures
- Exploiting stability for compact representation of independency models
- scientific article; zbMATH DE number 219256
- Conditional independence structure and its closure: inferential rules and algorithms
Cites work
- Bayesian network learning algorithms using structural restrictions
- Conditional independence structure and its closure: inferential rules and algorithms
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- Semigraphoids and structures of probabilistic conditional independence
- Separoids: a mathematical framework for conditional independence and irrelevance
Cited in
(8)- A lattice-based representation of independence relations for efficient closure computation
- Concise representations and construction algorithms for semi-graphoid independency models
- Exploiting stability for compact representation of independency models
- Representing independence models with elementary triplets
- Finding P-maps and I-maps to represent conditional independencies
- scientific article; zbMATH DE number 219256 (Why is no real title available?)
- Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs
- Exploiting independencies to compute semigraphoid and graphoid structures
This page was built for publication: Computing concise representations of semi-graphoid independency models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451186)