Causal discovery with a mixture of DAGs

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

Real causal processes may contain cycles, evolve over time or differ between populations. However, many graphical models cannot accommodate these conditions. We propose to model causation using a mixture of directed cyclic graphs (DAGs); each sample follows a joint distribution that factorizes according to a DAG, but the DAG may differ between samples due to multiple independent factors. We then introduce an algorithm called Causal Inference over Mixtures that uses longitudinal data to infer a graph summarizing the causal relations generated from a mixture of DAGs even when cycles, non-stationarity, latent variables or selection bias exist. Experiments demonstrate improved performance in inferring ancestral relations as compared to prior approaches. R code is available at https://github.com/ericstrobl/CIM.

Cite

CITATION STYLE

APA

Strobl, E. V. (2023). Causal discovery with a mixture of DAGs. Machine Learning, 112(11), 4201–4225. https://doi.org/10.1007/s10994-022-06159-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free