Learning high-dimensional directed acyclic graphs with latent and selection variables
From MaRDI portal
Publication:450035
DOI10.1214/11-AOS940zbMath1246.62131arXiv1104.5617OpenAlexW3103539622WikidataQ57707416 ScholiaQ57707416MaRDI QIDQ450035
Diego Colombo, Markus Kalisch, Thomas S. Richardson, Marloes H. Maathuis
Publication date: 3 September 2012
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.5617
consistencysparsityhigh-dimensionalitycausal structure learningFCI algorithmmaximal ancestral graphs (MAGs)partial ancestral graphs (PAGs)RFCI algorithm
Applications of graph theory (05C90) Applications of statistics (62P99) Directed graphs (digraphs), tournaments (05C20) Nonparametric inference (62G99)
Related Items
Towards fast and efficient algorithm for learning Bayesian network, Unnamed Item, Learning causal graphs with latent confounders in weak faithfulness violations, Estimating bounds on causal effects in high-dimensional and possibly confounded systems, Causal structure learning: a combinatorial perspective, Causal Structural Learning via Local Graphs, Improved baselines for causal structure learning on interventional data, Marginal integration for nonparametric causal inference, Learning high-dimensional directed acyclic graphs with latent and selection variables, Structural Intervention Distance for Evaluating Causal Graphs, Inferring gene regulatory networks by an order independent algorithm using incomplete data sets, Computation of maximum likelihood estimates in cyclic structural equation models, CAM: causal additive models, high-dimensional order search and penalized regression, A decomposition-based algorithm for learning the structure of multivariate regression chain graphs, Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data, Unnamed Item, Complete Graphical Characterization and Construction of Adjustment Sets in Markov Equivalence Classes of Ancestral Graphs, Uniform random generation of large acyclic digraphs, Nonparametric estimation of a latent variable model, Learning Bayesian network structures using weakest mutual-information-first strategy, Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach, Robust Causal Structure Learning with Some Hidden Variables, Learning causal structure from mixed data with missing values using Gaussian copula models, Log‐mean Linear Parameterization for Discrete Graphical Models of Marginal Independence and the Analysis of Dichotomizations, On the causal interpretation of acyclic mixed graphs under multivariate normality, A survey on causal discovery: theory and practice, A generalized back-door criterion, A uniformly consistent estimator of causal effects under the \(k\)-triangle-faithfulness assumption
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Markov equivalence for ancestral graphs
- Causal inference in statistics: an overview
- Estimating high-dimensional intervention effects from observational data
- Conditional independence for statistical operations
- Causation, prediction, and search
- A characterization of Markov equivalence classes for acyclic digraphs
- Ancestral graph Markov models.
- On the completeness of orientation rules for causal discovery in the presence of latent confounders and selection bias
- High-dimensional graphs and variable selection with the Lasso
- 10.1162/153244302760200696
