Recommendations
- An efficient algorithm for finding the largest chain graph according to a given chain graph
- A graphical characterization of the largest chain graphs
- On chain graph models for description of conditional independence structures
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
Cites work
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 4174001 (Why is no real title available?)
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 4126504 (Why is no real title available?)
- A characterization of Markov equivalence classes for acyclic digraphs
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Independence properties of directed markov fields
- Logical and algorithmic properties of conditional independence and graphical models
- Marginalization and collapsibility in graphical interaction models
Cited in
(23)- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
- On Block Ordering of Variables in Graphical Modelling
- Local structure recovery of chain graphs after marginalization
- Two operations of merging and splitting components in a chain graph
- Characterization of inclusion neighbourhood in terms of the essential graph
- scientific article; zbMATH DE number 5521183 (Why is no real title available?)
- An efficient algorithm for finding the largest chain graph according to a given chain graph
- A reconstruction algorithm for the essential graph
- Chain graph structure learning based on minimal c-separation trees
- Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
- On chain graph models for description of conditional independence structures
- Learning marginal AMP chain graphs under faithfulness revisited
- Separation and completeness properties for AMP chain graph Markov models.
- A scoring criterion for learning chain graphs
- Chain graphs structure learning given local background knowledge
- Identifiability and Consistent Estimation for Gaussian Chain Graph Models
- Learning Bayesian network structure: towards the essential graph by integer linear programming tools
- Characterizing Markov equivalence classes for AMP chain graph models
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Polyhedral approaches to learning Bayesian networks
- A graphical characterization of the largest chain graphs
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
This page was built for publication: A recovery algorithm for chain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1809371)
