Learning local directed acyclic graphs based on multivariate time series data
From MaRDI portal
Publication:386754
Abstract: Multivariate time series (MTS) data such as time course gene expression data in genomics are often collected to study the dynamic nature of the systems. These data provide important information about the causal dependency among a set of random variables. In this paper, we introduce a computationally efficient algorithm to learn directed acyclic graphs (DAGs) based on MTS data, focusing on learning the local structure of a given target variable. Our algorithm is based on learning all parents (P), all children (C) and some descendants (D) (PCD) iteratively, utilizing the time order of the variables to orient the edges. This time series PCD-PCD algorithm (tsPCD-PCD) extends the previous PCD-PCD algorithm to dependent observations and utilizes composite likelihood ratio tests (CLRTs) for testing the conditional independence. We present the asymptotic distribution of the CLRT statistic and show that the tsPCD-PCD is guaranteed to recover the true DAG structure when the faithfulness condition holds and the tests correctly reject the null hypotheses. Simulation studies show that the CLRTs are valid and perform well even when the sample sizes are small. In addition, the tsPCD-PCD algorithm outperforms the PCD-PCD algorithm in recovering the local graph structures. We illustrate the algorithm by analyzing a time course gene expression data related to mouse T-cell activation.
Recommendations
- Learning Graphical Models for Stationary Time Series
- An Efficient Approach to Graphical Modeling of Time Series
- Multivariate time-series classification with hierarchical variational graph pooling
- Learning of multivariate time series Granger causality based on graphical model methods
- Learning and distinguishing time series dynamics via ordinal patterns transition graphs
- Dynamic chain graph models for time series network data
- Structural learning about directed acyclic graphs from multiple databases
Cites work
- scientific article; zbMATH DE number 3522963 (Why is no real title available?)
- scientific article; zbMATH DE number 1222289 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- 10.1162/153244303321897717
- A Bayesian method for the induction of probabilistic networks from data
- A characterization of Markov equivalence classes for acyclic digraphs
- An empirical Bayesian method for estimating biological networks from temporal microarray data
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Bootstrap inference for network construction with an application to a breast cancer microarray study
- Causation, prediction, and search
- Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks
- Inferring gene dependency networks from genomic longitudinal data: a functional data approach
- Learning Causal Bayesian Network Structures From Experimental Data
- Learning local directed acyclic graphs based on multivariate time series data
Cited in
(2)
This page was built for publication: Learning local directed acyclic graphs based on multivariate time series data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386754)
