Finding the minimal set for collapsible graphical models
From MaRDI portal
Recommendations
Cites work
- Amendments and corrections
- Collapsibility and response variables in contingency tables
- Decomposition by clique separators
- scientific article; zbMATH DE number 48089 (Why is no real title available?)
- scientific article; zbMATH DE number 4867 (Why is no real title available?)
- Junction trees of general graphs
- Marginalization and collapsibility in graphical interaction models
- Optimal decomposition by clique separators
- Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models
- Sparse graphical models for exploring gene expression data
Cited in
(8)- Marginalization and collapsibility in graphical interaction models
- Decomposition of two classes of structural models
- Algorithms for convex hull finding in undirected graphical models
- Collapsibility for directed acyclic graphs
- scientific article; zbMATH DE number 1163789 (Why is no real title available?)
- Collapsibility of Graphical CG-Regression Models
- Paralinear distance and its algorithm for hierarchical clustering of high-dimensional discrete variables
- Hyper Markov law in undirected graphical models with its applications
This page was built for publication: Finding the minimal set for collapsible graphical models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082304)