Causal Discovery in Semi-Stationary Time Series

• URL: http://arxiv.org/abs/2407.07291v1
• Date: Wed, 10 Jul 2024 00:55:38 GMT
• Title: Causal Discovery in Semi-Stationary Time Series
• Authors: Shanyun Gao, Raghavendra Addanki, Tong Yu, Ryan A. Rossi, Murat Kocaoglu,
• Abstract summary: We propose a constraint-based, non-parametric algorithm for discovering causal relations in observational time series. We show that this algorithm is sound in identifying causal relations on discrete time series.
• Score: 32.424281626708336
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Discovering causal relations from observational time series without making the stationary assumption is a significant challenge. In practice, this challenge is common in many areas, such as retail sales, transportation systems, and medical science. Here, we consider this problem for a class of non-stationary time series. The structural causal model (SCM) of this type of time series, called the semi-stationary time series, exhibits that a finite number of different causal mechanisms occur sequentially and periodically across time. This model holds considerable practical utility because it can represent periodicity, including common occurrences such as seasonality and diurnal variation. We propose a constraint-based, non-parametric algorithm for discovering causal relations in this setting. The resulting algorithm, PCMCI$_{\Omega}$, can capture the alternating and recurring changes in the causal mechanisms and then identify the underlying causal graph with conditional independence (CI) tests. We show that this algorithm is sound in identifying causal relations on discrete time series. We validate the algorithm with extensive experiments on continuous and discrete simulated data. We also apply our algorithm to a real-world climate dataset.

Related papers

• Causal Discovery-Driven Change Point Detection in Time Series [32.424281626708336]
  Change point detection in time series seeks to identify times when the probability distribution of time series changes. In practical applications, we may be interested only in certain components of the time series, exploring abrupt changes in their distributions.
  arXiv  Detail & Related papers  (2024-07-10T00:54:42Z)
• Understanding Time Series Anomaly State Detection through One-Class Classification [13.822504564241454]
  In this article, we try to re-understand and define the time series anomaly detection problem through one-class classification (OCC) We first use processes and hypothesis testing to strictly define the 'time series anomaly state detection problem', and its corresponding anomalies. Then, we use the time series classification dataset to construct an artificial dataset corresponding to the problem. We compile 38 anomaly detection algorithms and correct some of the algorithms to adapt to handle this problem.
  arXiv  Detail & Related papers  (2024-02-03T03:43:04Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• 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)
• Causal Discovery from Subsampled Time Series with Proxy Variables [19.699813624529813]
  In this paper, we propose a constraint-based algorithm that can identify the entire causal structure from subsampled time series. Our algorithm is nonparametric and can achieve full causal identification.
  arXiv  Detail & Related papers  (2023-05-09T08:58:02Z)
• Causality-Based Multivariate Time Series Anomaly Detection [63.799474860969156]
  We formulate the anomaly detection problem from a causal perspective and view anomalies as instances that do not follow the regular causal mechanism to generate the multivariate data. We then propose a causality-based anomaly detection approach, which first learns the causal structure from data and then infers whether an instance is an anomaly relative to the local causal mechanism. We evaluate our approach with both simulated and public datasets as well as a case study on real-world AIOps applications.
  arXiv  Detail & Related papers  (2022-06-30T06:00:13Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• 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)
• Normalized multivariate time series causality analysis and causal graph reconstruction [0.0]
  Causality analysis is an important problem lying at the heart of science, and is of particular importance in data science and machine learning. This study introduces to the community this line of work, with a long-due generalization of the information flow-based bivariate time series causal inference. The resulting formula is transparent, and can be implemented as a computationally very efficient algorithm for application.
  arXiv  Detail & Related papers  (2021-04-23T00:46:35Z)
• Causal Expectation-Maximisation [70.45873402967297]
  We show that causal inference is NP-hard even in models characterised by polytree-shaped graphs. We introduce the causal EM algorithm to reconstruct the uncertainty about the latent variables from data about categorical manifest variables. We argue that there appears to be an unnoticed limitation to the trending idea that counterfactual bounds can often be computed without knowledge of the structural equations.
  arXiv  Detail & Related papers  (2020-11-04T10:25:13Z)
• TadGAN: Time Series Anomaly Detection Using Generative Adversarial Networks [73.01104041298031]
  TadGAN is an unsupervised anomaly detection approach built on Generative Adversarial Networks (GANs) To capture the temporal correlations of time series, we use LSTM Recurrent Neural Networks as base models for Generators and Critics. To demonstrate the performance and generalizability of our approach, we test several anomaly scoring techniques and report the best-suited one.
  arXiv  Detail & Related papers  (2020-09-16T15:52:04Z)

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.