On scoring maximal ancestral graphs with the max-min hill climbing algorithm

DOI10.1016/J.IJAR.2018.08.002zbMATH Open1448.68378OpenAlexW2885495226WikidataQ129399442 ScholiaQ129399442MaRDI QIDQ1726268FDOQ1726268

Authors: Konstantinos Tsirlis, Vincenzo Lagani, Sofia Triantafillou, Ioannis Tsamardinos 

Publication date: 20 February 2019

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

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

Recommendations

• The max-min hill-climbing Bayesian network structure learning algorithm
• Learning causal graphs with latent confounders in weak faithfulness violations
• Learning high-dimensional directed acyclic graphs with latent and selection variables
• Constraint-based inference algorithms for structural models with latent confounders -- empirical application and simulation
• scientific article

zbMATH Keywords

maximal ancestral graphshybrid causal structure learningmax-min hill climbing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Causation, prediction, and search
• The max-min hill-climbing Bayesian network structure learning algorithm
• Ancestral graph Markov models.
• Computing maximum likelihood estimates in recursive linear models with correlated errors
• Structural Intervention Distance for Evaluating Causal Graphs
• Introduction to causal inference
• Adaptive probabilistic networks with hidden variables
• On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
• Estimating bounds on causal effects in high-dimensional and possibly confounded systems

Cited In (4)

• Effective and efficient structure learning with pruning and model averaging strategies
• Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
• Causal structure learning: a combinatorial perspective
• Title not available (Why is that?)

Uses Software

• TETRAD
• Hailfinder

This page was built for publication: On scoring maximal ancestral graphs with the max-min hill climbing algorithm

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