A recovery algorithm for chain graphs

DOI10.1016/S0888-613X(97)00018-2zbMath0939.68096OpenAlexW2155490424MaRDI QIDQ1809371

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

zbMATH Keywords

chain graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Artificial intelligence (68T99)

Related Items

Learning marginal AMP chain graphs under faithfulness revisited, Unnamed Item, Learning AMP chain graphs and some marginal models thereof under faithfulness, Learning Bayesian network structure: towards the essential graph by integer linear programming tools, Polyhedral approaches to learning Bayesian networks, Local structure recovery of chain graphs after marginalization, CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS, A decomposition-based algorithm for learning the structure of multivariate regression chain graphs, A reconstruction algorithm for the essential graph, Characterization of inclusion neighbourhood in terms of the essential graph, Characterizing Markov equivalence classes for AMP chain graph models, A scoring criterion for learning chain graphs, On chain graph models for description of conditional independence structures, A graphical characterization of the largest chain graphs, A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs, Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs, On Block Ordering of Variables in Graphical Modelling, Separation and completeness properties for AMP chain graph Markov models.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Logical and algorithmic properties of conditional independence and graphical models
• A characterization of Markov equivalence classes for acyclic digraphs
• Marginalization and collapsibility in graphical interaction models
• Independence properties of directed markov fields