A recovery algorithm for chain graphs
From MaRDI portal
Publication:1809371
DOI10.1016/S0888-613X(97)00018-2zbMATH Open0939.68096OpenAlexW2155490424MaRDI QIDQ1809371FDOQ1809371
Authors: Milan Studený 
Publication date: 20 December 1999
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0888-613x(97)00018-2
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
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- A characterization of Markov equivalence classes for acyclic digraphs
- Title not available (Why is that?)
- Logical and algorithmic properties of conditional independence and graphical models
- Title not available (Why is that?)
- Title not available (Why is that?)
- Independence properties of directed markov fields
- Marginalization and collapsibility in graphical interaction models
- Title not available (Why is that?)
Cited In (21)
- 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
- Title not available (Why is that?)
- An efficient algorithm for finding the largest chain graph according to a given chain graph
- A reconstruction algorithm for the essential graph
- 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
- 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
- Polyhedral approaches to learning Bayesian networks
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- A graphical characterization of the largest chain graphs
- A decomposition-based algorithm for learning the structure of multivariate regression chain graphs
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
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)
