GNNs for Time Series Anomaly Detection: An Open-Source Framework and a Critical Evaluation

• URL: http://arxiv.org/abs/2603.09675v1
• Date: Tue, 10 Mar 2026 13:45:34 GMT
• Title: GNNs for Time Series Anomaly Detection: An Open-Source Framework and a Critical Evaluation
• Abstract summary: We present an open-source framework for graph-based Time Series Anomaly Detection (TSAD) using Graph Neural Networks (GNNs)<n>This work contributes both practical tools and critical insights to advance the development and evaluation of graph-based TSAD systems.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There is growing interest in applying graph-based methods to Time Series Anomaly Detection (TSAD), particularly Graph Neural Networks (GNNs), as they naturally model dependencies among multivariate signals. GNNs are typically used as backbones in score-based TSAD pipelines, where anomalies are identified through reconstruction or prediction errors followed by thresholding. However, and despite promising results, the field still lacks standardized frameworks for evaluation and suffers from persistent issues with metric design and interpretation. We thus present an open-source framework for TSAD using GNNs, designed to support reproducible experimentation across datasets, graph structures, and evaluation strategies. Built with flexibility and extensibility in mind, the framework facilitates systematic comparisons between TSAD models and enables in-depth analysis of performance and interpretability. Using this tool, we evaluate several GNN-based architectures alongside baseline models across two real-world datasets with contrasting structural characteristics. Our results show that GNNs not only improve detection performance but also offer significant gains in interpretability, an especially valuable feature for practical diagnosis. We also find that attention-based GNNs offer robustness when graph structure is uncertain or inferred. In addition, we reflect on common evaluation practices in TSAD, showing how certain metrics and thresholding strategies can obscure meaningful comparisons. Overall, this work contributes both practical tools and critical insights to advance the development and evaluation of graph-based TSAD systems.

Related papers

• AbstainGNN: Teaching Graph Neural Networks to Abstain for Graph Classification [56.26852966986448]
  AbstainGNN is a novel and theory-driven framework for graph classification with abstention.<n>It explicitly models both the predictive function and the abstention function, allowing for effective utilization of graph structural information.<n>Experiments on five benchmark datasets show that AbstainGNN outperforms existing abstention methods.
  arXiv  Detail & Related papers  (2026-05-29T03:21:14Z)
• A Unified Benchmark for Evaluating Knowledge Graph Construction Methods and Graph Neural Networks [1.9307742024764771]
  We introduce a dual-purpose benchmark designed to jointly evaluate the performance of Graph Neural Networks (GNNs) on noisy, text-derived graphs.<n>The benchmark is built in the biomedical domain from a single textual corpus.
  arXiv  Detail & Related papers  (2026-05-06T21:53:49Z)
• On the Impact of Graph Neural Networks in Recommender Systems: A Topological Perspective [49.391877616394765]
  In recommender systems, user-item interactions can be modeled as a bipartite graph, where user and item nodes are connected by undirected edges.<n>This graph-based view has motivated the rapid adoption of graph neural networks (GNNs)<n>Despite their empirical success, the reasons why GNNs offer systematic advantages over other approaches remain only partially understood.
  arXiv  Detail & Related papers  (2025-12-08T10:19:43Z)
• The Impact of Data Characteristics on GNN Evaluation for Detecting Fake News [0.04774522315161165]
  Graph neural networks (GNNs) are widely used for the detection of fake news by modeling the content and propagation structure of news articles on social media.<n>We show that two of the most commonly used benchmark data sets - GossipCop and PolitiFact - are poorly suited to evaluating the utility of models that use propagation structure.
  arXiv  Detail & Related papers  (2025-12-07T03:00:38Z)
• Pruning Graphs by Adversarial Robustness Evaluation to Strengthen GNN Defenses [1.066048003460524]
  Graph Neural Networks (GNNs) have emerged as a dominant paradigm for learning on graph-structured data.<n>In this work, we introduce a pruning framework that leverages adversarial robustness evaluation to explicitly identify and remove detrimental components of the graph.<n>By using robustness scores as guidance, our method selectively prunes edges that are most likely to degrade model reliability, thereby yielding cleaner and more resilient graph representations.
  arXiv  Detail & Related papers  (2025-11-29T20:15:54Z)
• ACTGNN: Assessment of Clustering Tendency with Synthetically-Trained Graph Neural Networks [4.668678950572517]
  ACTGNN is a graph-based framework designed to assess clustering tendency by leveraging graph representations of data.<n>A Graph Neural Network (GNN) is trained exclusively on synthetic datasets, enabling robust learning of clustering structures.<n>Our results highlight the generalizability and effectiveness of the proposed approach, making it a promising tool for robust clustering tendency assessment.
  arXiv  Detail & Related papers  (2025-01-30T03:31:26Z)
• Are GNNs Actually Effective for Multimodal Fault Diagnosis in Microservice Systems? [3.3601815104322377]
  Graph Neural Networks (GNNs) are widely adopted for fault diagnosis in microservice systems, premised on their ability to model service dependencies.<n>To isolate the true value of GNNs, we propose DiagMLP, a deliberately minimal, topology-agnostic baseline.<n>DiagMLP achieves performance parity with state-of-the-art GNN-based methods in fault detection, localization, and classification.
  arXiv  Detail & Related papers  (2025-01-06T05:18:13Z)
• Online GNN Evaluation Under Test-time Graph Distribution Shifts [92.4376834462224]
  A new research problem, online GNN evaluation, aims to provide valuable insights into the well-trained GNNs's ability to generalize to real-world unlabeled graphs. We develop an effective learning behavior discrepancy score, dubbed LeBeD, to estimate the test-time generalization errors of well-trained GNN models.
  arXiv  Detail & Related papers  (2024-03-15T01:28:08Z)
• Uncertainty in GNN Learning Evaluations: The Importance of a Consistent Benchmark for Community Detection [4.358468367889626]
  We propose a framework to establish a common evaluation protocol for Graph Neural Networks (GNNs) We motivate and justify it by demonstrating the differences with and without the protocol. We find that by ensuring the same evaluation criteria is followed, there may be significant differences from the reported performance of methods at this task.
  arXiv  Detail & Related papers  (2023-05-10T10:22:28Z)
• Energy-based Out-of-Distribution Detection for Graph Neural Networks [76.0242218180483]
  We propose a simple, powerful and efficient OOD detection model for GNN-based learning on graphs, which we call GNNSafe. GNNSafe achieves up to $17.0%$ AUROC improvement over state-of-the-arts and it could serve as simple yet strong baselines in such an under-developed area.
  arXiv  Detail & Related papers  (2023-02-06T16:38:43Z)
• Space-Time Graph Neural Networks with Stochastic Graph Perturbations [100.31591011966603]
  Space-time graph neural networks (ST-GNNs) learn efficient graph representations of time-varying data. In this paper we revisit the properties of ST-GNNs and prove that they are stable to graph stabilitys. Our analysis suggests that ST-GNNs are suitable for transfer learning on time-varying graphs.
  arXiv  Detail & Related papers  (2022-10-28T16:59:51Z)
• Learning to Drop: Robust Graph Neural Network via Topological Denoising [50.81722989898142]
  We propose PTDNet, a parameterized topological denoising network, to improve the robustness and generalization performance of Graph Neural Networks (GNNs) PTDNet prunes task-irrelevant edges by penalizing the number of edges in the sparsified graph with parameterized networks. We show that PTDNet can improve the performance of GNNs significantly and the performance gain becomes larger for more noisy datasets.
  arXiv  Detail & Related papers  (2020-11-13T18:53:21Z)
• Amortized Probabilistic Detection of Communities in Graphs [39.56798207634738]
  We propose a simple framework for amortized community detection. We combine the expressive power of GNNs with recent methods for amortized clustering. We evaluate several models from our framework on synthetic and real datasets.
  arXiv  Detail & Related papers  (2020-10-29T16:18:48Z)

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.