AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms

DOI10.1613/jair.1.12101zbMath1490.68186arXiv2002.10870OpenAlexW3092089368MaRDI QIDQ5130009

Mohammad Ali Javidian, Marco Valtorta, Pooyan Jamshidi

Publication date: 3 November 2020

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.10870

zbMATH Keywords

Bayesian networksdata miningmachine learningprobabilistic reasoning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probabilistic graphical models (62H22)

Related Items (1)

A decomposition-based algorithm for learning the structure of multivariate regression chain graphs

Uses Software

• R
• AgenaRisk
• bnlearn
• TETRAD
• gRapHD
• MIM
• Hailfinder
• BENEDICT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete chain graph models
• High-dimensional structure estimation in Ising models: local separation criterion
• The max-min hill-climbing Bayesian network structure learning algorithm
• Learning marginal AMP chain graphs under faithfulness revisited
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression
• Graphical models for associations between variables, some of which are qualitative and some quantitative
• Causation, prediction, and search
• Adaptive probabilistic networks with hidden variables
• Efficient enumeration of all minimal separators in a graph
• Linear dependencies represented by chain graphs. With comments and a rejoinder by the authors
• Separation and completeness properties for AMP chain graph Markov models.
• Ancestral graph Markov models.
• Maximum cardinality search for computing minimal triangulations of graphs
• Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework
• Chain graph interpretations and their relations revisited
• Marginal AMP chain graphs
• Characterizing Markov equivalence classes for AMP chain graph models
• The computational complexity of probabilistic inference using Bayesian belief networks
• Alternative Markov Properties for Chain Graphs
• Graphical Models with R
• Order-Independent Structure Learning of Multivariate Regression Chain Graphs
• On Block Ordering of Variables in Graphical Modelling
• Bayesian Networks and Decision Graphs
• Every LWF and AMP Chain Graph Originates from a Set of Causal Models
• Efficient Markov Network Structure Discovery Using Independence Tests
• Probabilistic Networks and Expert Systems
• Introduction to Graphical Modelling
• Probabilistic Reasoning in Multiagent Systems
• Bayesian Networks in R
• Indirect Causes in Dynamic Bayesian Networks Revisited
• A Unified Approach to the Characterization of Equivalence Classes of DAGs, Chain Graphs with no Flags and Chain Graphs
• Approximating discrete probability distributions with dependence trees
• Reconstruction of Markov Random Fields from Samples: Some Observations and Algorithms
• A hybrid methodology for learning belief networks: BENEDICT

This page was built for publication: AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms