A reconstruction algorithm for the essential graph
From MaRDI portal
Publication:962864
DOI10.1016/J.IJAR.2008.09.001zbMATH Open1191.68534OpenAlexW2129118887MaRDI QIDQ962864FDOQ962864
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
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
- A characterization of Markov equivalence classes for acyclic digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic Networks and Expert Systems
- 10.1162/153244303321897717
- Title not available (Why is that?)
- Racing algorithms for conditional independence inference
- On the Markov Equivalence of Chain Graphs, Undirected Graphs, and Acyclic Digraphs
- A recovery algorithm for chain graphs
- Characterization of inclusion neighbourhood in terms of the essential graph
- Graphical and algebraic representatives of conditional independence models
- Two operations of merging and splitting components in a chain graph
- A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
Cited In (9)
- Reconstruction Algorithm for Permutation Graphs
- A geometric view on learning Bayesian network structures
- On open questions in the geometric approach to structural learning Bayesian nets
- A new prior for discrete DAG models with a restricted set of directions
- Reconstituting beta graphs into an efficacious system
- Standard imsets for undirected and chain graphical models
- Structural Markov graph laws for Bayesian model uncertainty
- Characteristic imsets for learning Bayesian network structure
- CHARACTERIZATION OF ESSENTIAL GRAPHS BY MEANS OF THE OPERATION OF LEGAL MERGING OF COMPONENTS
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)
