mlsanityData to 14 Oct 2026

Timestamp-Aware Spatio-Temporal Graph Contrastive Learning for Network Intrusion Detection

arXiv 2606.17109 ↗First posted 15 Jun 2026cs.CR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Given their effectiveness in modeling the relational structure among network traffic flows, graph neural networks (GNNs) have been widely adopted in network intrusion detection systems (NIDSs). However, most existing GNN-based NIDS approaches focus on the relational structure of traffic flows, and treat them as temporally independent, which limits their ability to cope with evolving attack behaviors. Moreover, their reliance on supervised or semi-supervised learning often restricts generalization to unseen attacks. To address these limitations, we propose a novel self-supervised GNN-based framework. To the best of our knowledge, the proposed model is among the first self-supervised GNN-based NIDS models to explicitly leverage real timestamps, which provides faithful temporal dependencies for representation learning. We first construct a series of temporal graphs from network traffic flows according to their timestamps, and then employ an E-GraphSAGE and LSTM based encoder to fully extract temporal information and spatial dependencies of network traffic, without introducing time-costly attention mechanisms. A multi-view graph contrastive learning (GCL) scheme is introduced, where temporal, spatial, and feature contrasts are jointly performed to capture temporal continuity, preserve structural consistency, and improve the generalization and robustness of the learned representations, respectively. In addition, a gradient-norm-based adaptive weighting strategy is designed to optimize the contrastive loss weights. Experimental results on four representative NIDS datasets with real timestamps demonstrate that our method significantly outperforms existing self-supervised approaches and achieves performance comparable to the supervised state-of-the-art GNN method, while maintaining high computational efficiency.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 17 of its 38 references that are in the map. First posted on arXiv 15 Jun 2026.

Builds on

17 of 38 references.

References · 17

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2017Graph Attention Networkscited by 8,923
  3. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  4. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  5. 2016Variational Graph Auto-Encoderscited by 1,382
  6. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  7. 2018Deep Graph Infomaxcited by 1,106
  8. 2020Self-supervised Learning: Generative or Contrastivecited by 694
  9. 2021Graph Self-Supervised Learning: A Surveycited by 289
  10. 2018Towards the Development of Realistic Botnet Dataset in the Internet of Things for Network Forensic Analytics: Bot-IoT Datasetcited by 99
  11. 2021E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoTcited by 56
  12. 2022Anomal-E: A Self-Supervised Network Intrusion Detection System based on Graph Neural Networkscited by 27
5 more
  1. 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
  2. 2023Spatio-Temporal Graph Neural Networks: A Surveycited by 23
  3. 2022Generative Subgraph Contrast for Self-Supervised Graph Representation Learningcited by 8
  4. 2024Applying Self-supervised Learning to Network Intrusion Detection for Network Flows with Graph Neural Networkcited by 7
  5. 2021Self-Supervised Dynamic Graph Representation Learning via Temporal Subgraph Contrastcited by 5

Built on by

Not cited yet.