Learning marginal AMP chain graphs under faithfulness revisited
From MaRDI portal
Publication:895520
DOI10.1016/j.ijar.2015.09.004zbMath1346.68162MaRDI QIDQ895520
Manuel Gómez-Olmedo, José-Maria Peña
Publication date: 3 December 2015
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2015.09.004
62H12: Estimation in multivariate analysis
05C90: Applications of graph theory
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Uses Software
Cites Work
- Causation, prediction, and search
- A characterization of Markov equivalence classes for acyclic digraphs
- A recovery algorithm for chain graphs
- Ancestral graph Markov models.
- Marginalizing and conditioning in graphical models
- Chain graph interpretations and their relations revisited
- Learning AMP chain graphs and some marginal models thereof under faithfulness
- Marginal AMP chain graphs
- Markov properties for mixed graphs
- Characterizing Markov equivalence classes for AMP chain graph models
- Alternative Markov Properties for Chain Graphs
- Learning Marginal AMP Chain Graphs under Faithfulness
- 10.1162/153244303321897717
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item