Discovery of Extended Summary Graphs in Time Series
Abstract
This study addresses the problem of learning an extended summary causal graph from 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 behaviour of our method is illustrated through several experiments.
Cite
Text
Assaad et al. "Discovery of Extended Summary Graphs in Time Series." Uncertainty in Artificial Intelligence, 2022.Markdown
[Assaad et al. "Discovery of Extended Summary Graphs in Time Series." Uncertainty in Artificial Intelligence, 2022.](https://mlanthology.org/uai/2022/assaad2022uai-discovery/)BibTeX
@inproceedings{assaad2022uai-discovery,
title = {{Discovery of Extended Summary Graphs in Time Series}},
author = {Assaad, Charles K. and Devijver, Emilie and Gaussier, Eric},
booktitle = {Uncertainty in Artificial Intelligence},
year = {2022},
pages = {96-106},
volume = {180},
url = {https://mlanthology.org/uai/2022/assaad2022uai-discovery/}
}