Inferring extended summary causal graphs from observational time series

• URL: http://arxiv.org/abs/2205.09422v1
• Date: Thu, 19 May 2022 09:39:57 GMT
• Title: Inferring extended summary causal graphs from observational time series
• Authors: Charles K. Assaad, Emilie Devijver, and Eric Gaussier
• Abstract summary: We make use of information-theoretic measures to determine (in)dependencies between time series. The behavior of our methods is illustrated through several experiments run on simulated and real datasets.
• Score: 4.263043028086137
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This study addresses the problem of learning an extended summary causal graph on time series. The algorithms we propose fit within the well-known constraint-based framework for causal discovery and make use of information-theoretic measures to determine (in)dependencies between time series. We first introduce generalizations of the causation entropy measure to any lagged or instantaneous relations, prior to using this measure to construct extended summary causal graphs by adapting two well-known algorithms, namely PC and FCI. The behavior of our methods is illustrated through several experiments run on simulated and real datasets.

Related papers

• Adaptive Online Experimental Design for Causal Discovery [9.447864414136905]
  Causal discovery aims to uncover cause-and-effect relationships encoded in causal graphs. We focus on data interventional efficiency and formalize causal discovery from the perspective of online learning. We propose a track-and-stop causal discovery algorithm that adaptively selects interventions from the graph separating system.
  arXiv  Detail & Related papers  (2024-05-19T13:26:33Z)
• Causal Temporal Regime Structure Learning [49.77103348208835]
  We present CASTOR, a novel method that concurrently learns the Directed Acyclic Graph (DAG) for each regime. We establish the identifiability of the regimes and DAGs within our framework. Experiments show that CASTOR consistently outperforms existing causal discovery models.
  arXiv  Detail & Related papers  (2023-11-02T17:26:49Z)
• From Temporal to Contemporaneous Iterative Causal Discovery in the Presence of Latent Confounders [6.365889364810238]
  We present a constraint-based algorithm for learning causal structures from observational time-series data. We assume a discrete-time, stationary structural vector autoregressive process, with both temporal and contemporaneous causal relations. The presented algorithm gradually refines a causal graph by learning long-term temporal relations before short-term ones, where contemporaneous relations are learned last.
  arXiv  Detail & Related papers  (2023-06-01T12:46:06Z)
• Causal discovery for time series with constraint-based model and PMIME measure [0.0]
  We present a novel approach for discovering causality in time series data that combines a causal discovery algorithm with an information theoretic-based measure. We evaluate the performance of our approach on several simulated data sets, showing promising results.
  arXiv  Detail & Related papers  (2023-05-31T09:38:50Z)
• Graphical estimation of multivariate count time series [0.0]
  The algorithm is applied to observed dengue disease counts from each ward of Greater Mumbai city. It is observed that some special wards act as epicentres of dengue spread even though their disease counts are relatively low.
  arXiv  Detail & Related papers  (2023-02-17T10:54:13Z)
• An Empirical Study: Extensive Deep Temporal Point Process [61.14164208094238]
  We first review recent research emphasis and difficulties in modeling asynchronous event sequences with deep temporal point process. We propose a Granger causality discovery framework for exploiting the relations among multi-types of events.
  arXiv  Detail & Related papers  (2021-10-19T10:15:00Z)
• Entropy-based Discovery of Summary Causal Graphs in Time Series [3.360922672565234]
  We first propose a new causal temporal mutual information measure for time series. We then show how this measure relates to an entropy reduction principle. We combine these two ingredients in PC-like and FCI-like algorithms to construct the summary causal graph.
  arXiv  Detail & Related papers  (2021-05-21T14:47:18Z)
• Consistency of mechanistic causal discovery in continuous-time using Neural ODEs [85.7910042199734]
  We consider causal discovery in continuous-time for the study of dynamical systems. We propose a causal discovery algorithm based on penalized Neural ODEs.
  arXiv  Detail & Related papers  (2021-05-06T08:48:02Z)
• One-shot Learning for Temporal Knowledge Graphs [49.41854171118697]
  We propose a one-shot learning framework for link prediction in temporal knowledge graphs. Our proposed method employs a self-attention mechanism to effectively encode temporal interactions between entities. Our experiments show that the proposed algorithm outperforms the state of the art baselines for two well-studied benchmarks.
  arXiv  Detail & Related papers  (2020-10-23T03:24:44Z)
• Amortized Causal Discovery: Learning to Infer Causal Graphs from Time-Series Data [63.15776078733762]
  We propose Amortized Causal Discovery, a novel framework to learn to infer causal relations from time-series data. We demonstrate experimentally that this approach, implemented as a variational model, leads to significant improvements in causal discovery performance.
  arXiv  Detail & Related papers  (2020-06-18T19:59:12Z)
• Learned Factor Graphs for Inference from Stationary Time Sequences [107.63351413549992]
  We propose a framework that combines model-based algorithms and data-driven ML tools for stationary time sequences. neural networks are developed to separately learn specific components of a factor graph describing the distribution of the time sequence. We present an inference algorithm based on learned stationary factor graphs, which learns to implement the sum-product scheme from labeled data.
  arXiv  Detail & Related papers  (2020-06-05T07:06:19Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.