Learning AMP chain graphs and some marginal models thereof under faithfulness
From MaRDI portal
Publication:2440186
DOI10.1016/j.ijar.2014.01.003zbMath1416.62377MaRDI QIDQ2440186
Publication date: 27 March 2014
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2014.01.003
62H99: Multivariate analysis
62H20: Measures of association (correlation, canonical correlation, etc.)
05C90: Applications of graph theory
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Learning marginal AMP chain graphs under faithfulness revisited, Chain graph interpretations and their relations revisited
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Causation, prediction, and search
- A recovery algorithm for chain graphs
- Separation and completeness properties for AMP chain graph Markov models.
- Ancestral graph Markov models.
- Marginalizing and conditioning in graphical models
- Reading dependencies from covariance graphs
- Characterizing Markov equivalence classes for AMP chain graph models
- Alternative Markov Properties for Chain Graphs
- Maximum Likelihood Estimation in Gaussian Chain Graph Models under the Alternative Markov Property
- 10.1162/153244303321897717
- On a Dualization of Graphical Gaussian Models: A Correction Note
- Chain Graph Interpretations and Their Relations