On scoring maximal ancestral graphs with the max-min hill climbing algorithm
From MaRDI portal
Publication:1726268
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 DE number 6378135
Cites work
- Adaptive probabilistic networks with hidden variables
- Ancestral graph Markov models.
- Causation, prediction, and search
- Computing maximum likelihood estimates in recursive linear models with correlated errors
- Estimating bounds on causal effects in high-dimensional and possibly confounded systems
- Introduction to causal inference
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Structural intervention distance for evaluating causal graphs
- The max-min hill-climbing Bayesian network structure learning algorithm
Cited in
(6)- Three-way causal structure representation and learning for uncertainty
- 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
- Learning causal graphs with latent confounders in weak faithfulness violations
- Causal structure learning: a combinatorial perspective
- scientific article; zbMATH DE number 7306854 (Why is no real title available?)
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)
