Charles K. Assaad

Dr. Charles K. Assaad

EasyVista, Grenoble, Auvergne-Rhône-Alpes, France
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 February 2022 in Journal of Artificial Intelligence Research
Verified
Journal Article
Closed access
PDF file
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
We introduce in this survey the major concepts, models, and algorithms proposed so far to infer causal relations from observational time series, a task usually referred to as causal discovery in time series. To do so, after a description of the underlying concepts and modelling assumptions, we present different methods according to the family of approaches they belong to: Granger causality, constraint-based approaches, noise-based approaches, score-based approaches, logic-based approaches, topology-based approaches, and difference-based approaches. We then evaluate several representative methods to illustrate the behaviour of different families of approaches. This illustration is conducted on both artificial and real datasets, with different characteristics. The main conclusions one can draw from this survey is that causal discovery in times series is an active research field in which new methods (in every family of approaches) are regularly proposed, and that no family or method stands out in all situations. Indeed, they all rely on assumptions that may or may not be appropriate for a particular dataset.

19 August 2022 in Entropy
Verified
Journal Article
Open access
PDF file
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
This study addresses the problem of learning a summary causal graph on time series with potentially different sampling rates. To do so, 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 that can be seen as a special case of the probability raising principle. We finally combine these two ingredients in PC-like and FCI-like algorithms to construct the summary causal graph. There algorithm are evaluated on several datasets, which shows both their efficacy and efficiency.

2 September 2022 in Entropy
Verified
Journal Article
Open access
PDF file
LZLei ZAN
Lei ZAN
AMAnouar Meynaoui
Anouar Meynaoui
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
In this study, we focus on mixed data which are either observations of univariate random variables which can be quantitative or qualitative, or observations of multivariate random variables such that each variable can include both quantitative and qualitative components. We first propose a novel method, called CMIh, to estimate conditional mutual information taking advantages of the previously proposed approaches for qualitative and quantitative data. We then introduce a new local permutation test, called LocAT for local adaptive test, which is well adapted to mixed data. Our experiments illustrate the good behaviour of CMIh and LocAT, and show their respective abilities to accurately estimate conditional mutual information and to detect conditional (in)dependence for mixed data.

10 September 2021
Verified
Book Chapter
Closed access
PDF file
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
AAAli Ait-Bachir
Ali Ait-Bachir

28 July 2023 in arXiv
Verified
Preprint
Open access
PDF file
AAAli Aït-Bachir
Ali Aït-Bachir
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
CBChristophe de Bignicourt
Christophe de Bignicourt
EDEmilie Devijver
Emilie Devijver
SFSimon Ferreira
Simon Ferreira
LZLei Zan
Lei Zan
Information technology (IT) systems are vital for modern businesses, handling data storage, communication, and process automation. Monitoring these systems is crucial for their proper functioning and efficiency, as it allows collecting extensive observational time series data for analysis. The interest in causal discovery is growing in IT monitoring systems as knowing causal relations between different components of the IT system helps in reducing downtime, enhancing system performance and identifying root causes of anomalies and incidents. It also allows proactive prediction of future issues through historical data analysis. Despite its potential benefits, applying causal discovery algorithms on IT monitoring data poses challenges, due to the complexity of the data. For instance, IT monitoring data often contains misaligned time series, sleeping time series, timestamp errors and missing values. This paper presents case studies on applying causal discovery algorithms to different IT monitoring datasets, highlighting benefits and ongoing challenges.

21 October 2024
Verified
Conference Paper
Open access
LZLei ZAN
Lei ZAN
Charles K. AssaadCharles K. Assaad
Charles K. Assaad
EDEmilie Devijver
Emilie Devijver
EGEric Gaussier
Eric Gaussier
AAAli Aït-Bachir
Ali Aït-Bachir
This paper introduces a new structural causal model tailored for representing threshold-based IT systems and presents a new algorithm designed to rapidly detect root causes of anomalies in such systems. When root causes are not causally related, the method is proven to be correct; while an extension is proposed based on the intervention of an agent to relax this assumption. Our algorithm and its agent-based extension leverage causal discovery from offline data and engage in subgraph traversal when encountering new anomalies in online data. Our extensive experiments demonstrate the superior performance of our methods, even when applied to data generated from alternative structural causal models or real IT monitoring data.