A reconstruction algorithm for the essential graph

DOI10.1016/J.IJAR.2008.09.001MaRDI QIDQ962864zbMATH OpenOpenAlexFDO

Authors Milan Studený, Jiří Vomlel

Publication date 7 April 2010

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2008.09.001

zbMATH Keywords

chain graphBayesian network structureessential graphstandard imset

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• Graphical and algebraic representatives of conditional independence models
• Learning Bayesian network structure: towards the essential graph by integer linear programming tools
• Characteristic imsets for learning Bayesian network structure
• A recovery algorithm for chain graphs

Cites work

• scientific article; zbMATH DE number 4174001 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2150792 (Why is no real title available?)
• 10.1162/153244303321897717
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• A characterization of Markov equivalence classes for acyclic digraphs
• A recovery algorithm for chain graphs
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• Characterization of inclusion neighbourhood in terms of the essential graph
• Graphical and algebraic representatives of conditional independence models
• On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
• Probabilistic Networks and Expert Systems
• Racing algorithms for conditional independence inference
• Two operations of merging and splitting components in a chain graph

Cited in

(9)

• A new prior for discrete DAG models with a restricted set of directions
• Standard imsets for undirected and chain graphical models
• Structural Markov graph laws for Bayesian model uncertainty
• Reconstruction Algorithm for Permutation Graphs
• On open questions in the geometric approach to structural learning Bayesian nets
• CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
• A geometric view on learning Bayesian network structures
• Reconstituting beta graphs into an efficacious system
• Characteristic imsets for learning Bayesian network structure

This page was built for publication: A reconstruction algorithm for the essential graph

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