CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

DOI10.1142/S0218488504002576MaRDI QIDQ5696977zbMATH OpenOpenAlexFDO

Authors Milan Studený

Publication date 19 October 2005

Published in International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0218488504002576

zbMATH Keywords

acyclic directed graphchain graphessential graphflaglegal merging

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Two operations of merging and splitting components in a chain graph
• A reconstruction algorithm for the essential graph
• A characterization of Markov equivalence classes for acyclic digraphs
• scientific article; zbMATH DE number 1894279
• Some results about essential graphs

Cites work

• A graphical characterization of the largest chain graphs
• A recovery algorithm for chain graphs
• Alternative Markov properties for chain graphs
• Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs

Cited in

(10)

• Chain graph models: topological sorting of meta-arrows and efficient construction of \(\mathcal B\)-essential graphs
• Characterization of inclusion neighbourhood in terms of the essential graph
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• On Block Ordering of Variables in Graphical Modelling
• Characterization of inclusion neighbourhood in terms of the essential graph: upper neighbours
• Two operations of merging and splitting components in a chain graph
• scientific article; zbMATH DE number 1894279 (Why is no real title available?)
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Bayesian diagnostics for chain event graphs
• A reconstruction algorithm for the essential graph

This page was built for publication: CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696977)