Learning causal graphs with latent confounders in weak faithfulness violations
From MaRDI portal
Publication:1670497
DOI10.1007/S00354-016-0003-XzbMATH Open1442.68196OpenAlexW2566398328MaRDI QIDQ1670497FDOQ1670497
Authors: Takashi Isozaki, Manabu Kuroki 
Publication date: 5 September 2018
Published in: New Generation Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00354-016-0003-x
Recommendations
- Learning linear non-Gaussian causal models in the presence of latent variables
- Causal Graphical Models with Latent Variables: Learning and Inference
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Causal Structural Learning via Local Graphs
Cites Work
- Causation, prediction, and search
- Bayesian network structure learning by recursive autonomy identification
- Title not available (Why is that?)
- Ancestral graph Markov models.
- Conditional independence for statistical operations
- Title not available (Why is that?)
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Adaptive probabilistic networks with hidden variables
- Title not available (Why is that?)
- A recursive method for structural learning of directed acyclic graphs
- Title not available (Why is that?)
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
Cited In (8)
- On scoring maximal ancestral graphs with the max-min hill climbing algorithm
- Logic of causal inference from data under presence of latent confounders
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
- Learning Neighborhoods of High Confidence in Constraint-Based Causal Discovery
- Characterization of causal ancestral graphs for time series with latent confounders
- Causal Graphical Models with Latent Variables: Learning and Inference
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- Conservative independence-based causal structure learning in absence of adjacency faithfulness
Uses Software
This page was built for publication: Learning causal graphs with latent confounders in weak faithfulness violations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1670497)
