Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Saima Absar

dblp:305/0071 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4 · 3 first-author · 4 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › causal inference
causal discovery
0.912025
Root Cause Analysis of Anomalies in Multivariate Time Series through Granger Causal Discovery · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference › causal discovery
granger causality
0.912025
Root Cause Analysis of Anomalies in Multivariate Time Series through Granger Causal Discovery · ICLR 2025
Machine learning › Probabilistic and Bayesian machine learning › causal inference
root cause analysis
0.912025
Root Cause Analysis of Anomalies in Multivariate Time Series through Granger Causal Discovery · ICLR 2025
Data mining
anomaly detection
0.312025
Root Cause Analysis of Anomalies in Multivariate Time Series through Granger Causal Discovery · ICLR 2025
Data mining › anomaly detection › time series anomaly detection
multivariate time series anomaly detection
0.312025
Root Cause Analysis of Anomalies in Multivariate Time Series through Granger Causal Discovery · ICLR 2025

Methods — techniques the papers use, named apart from their topics

granger causal discovery · 1.7exogenous variable modeling · 1.7
YearPublicationVenuePosition
2025 Root Cause Analysis of Anomalies in Multivariate Time Series through Granger Causal Discovery
abstract
Identifying the root causes of anomalies in multivariate time series is challenging due to the complex dependencies among the series. In this paper, we propose a comprehensive approach called AERCA that inherently integrates Granger causal discovery with root cause analysis. By defining anomalies as interventions on the exogenous variables of time series, AERCA not only learns the Granger causality among time series but also explicitly models the distributions of exogenous variables under normal conditions. AERCA then identifies the root causes of anomalies by highlighting exogenous variables that significantly deviate from their normal states. Experiments on multiple synthetic and real-world datasets demonstrate that AERCA can accurately capture the causal relationships among time series and effectively identify the root causes of anomalies.
Xiao Han 0008, Saima Absar, Lu Zhang 0021, Shuhan Yuan
ICLR2
2024 Time Series Causal Discovery Using a Hybrid Method
abstract
In this paper, we introduce a novel framework, Neural-HATS for inferring causal structures in time series data using a hybrid method. Neural-HATS uniquely combines conditional independence (CI) testing with continuous optimization-based learning methods to enhance causal discovery. Specifically, it leverages an attention-based encoder-decoder architecture with Kernel Conditional Independence (KCI) testing to enable direct CI tests between time series. These CI test results are integrated into continuous optimization algorithms, enhancing both causal inference accuracy and the effectiveness of continuous optimization models. Experimental evaluations demonstrate that Neural-HATS achieves improved causal graph accuracy.
Saima Absar, Lu Zhang 0021
IEEE Big Data1
2023 Neural Time-Invariant Causal Discovery from Time Series Data
abstract
Causal structure learning from observational data is an active field of research over the past decades. Although many approaches exist, such as constrained-based methods and score-based methods including the emerging deep learning-based methods, most of them address the static, non-dynamic setting. In this paper, we propose a score-based causal discovery algorithm named Neural Time-invariant Causal Discovery (NTiCD), which learns summary causal graphs from multivariate time series data based on the principle of Granger causality. NTiCD is a continuous optimization-based technique that leverages the power of deep neural networks to compute the score values. To this end, we use an LSTM to obtain the hidden non-linear representations of temporal variables in the time series data. Then, these features are aggregated using graph convolutional networks and decoded using an MLP that outputs the forecast of the future data values in the time series. The model is optimized based on a score function subject to regularized loss. The final output is a summary causal graph that captures the time-invariant causal relations within and between time series. We evaluate the performance of our algorithm on several synthetic and real datasets. The result analysis over a number of different datasets demonstrates the improvement in the accuracy of causal structure discovery of temporal data compared to other state-of-the-art methods.
Saima Absar, Yongkai Wu, Lu Zhang 0021
IJCNN1
2021 Discovering Time-invariant Causal Structure from Temporal Data
abstract
Discovering causal structure from temporal data is an important problem in many fields in science. Existing methods usually suffer from several limitations such as assuming linear dependencies among features, limiting to discrete time series, and/or assuming stationarity, i.e., causal dependencies are repeated with the same time lag and strength at all time points. In this paper, we propose an algorithm called the μ-PC that addresses these limitations. It is based on the theory of μ-separation and extends the well-known PC algorithm to the time domain. To be applicable to both discrete and continuous time series, we develop a conditional independence testing technique for time series by leveraging the Recurrent Marked Temporal Point Process (RMTPP) model. Experiments using both synthetic and real-world datasets demonstrate the effectiveness of the proposed algorithm.
Saima Absar, Lu Zhang 0021
CIKM1