mlsanityData to 14 Oct 2026

ARES: Anomaly Recognition Model For Edge Streams

arXiv 2511.22078 ↗First posted 27 Nov 2025cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Many real-world scenarios involving streaming information can be represented as temporal graphs, where data flows through dynamic changes in edges over time. Anomaly detection in this context has the objective of identifying unusual temporal connections within the graph structure. Detecting edge anomalies in real time is crucial for mitigating potential risks. Unlike traditional anomaly detection, this task is particularly challenging due to concept drifts, large data volumes, and the need for real-time response. To face these challenges, we introduce ARES, an unsupervised anomaly detection framework for edge streams. ARES combines Graph Neural Networks (GNNs) for feature extraction with Half-Space Trees (HST) for anomaly scoring. GNNs capture both spike and burst anomalous behaviors within streams by embedding node and edge properties in a latent space, while HST partitions this space to isolate anomalies efficiently. ARES operates in an unsupervised way without the need for prior data labeling. To further validate its detection capabilities, we additionally incorporate a simple yet effective supervised thresholding mechanism. This approach leverages statistical dispersion among anomaly scores to determine the optimal threshold using a minimal set of labeled data, ensuring adaptability across different domains. We validate ARES through extensive evaluations across several real-world cyber-attack scenarios, comparing its performance against existing methods while analyzing its space and time complexity.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 20 of its 59 references that are in the map. First posted on arXiv 27 Nov 2025.

Builds on

20 of 59 references.

References · 20

  1. 2017Inductive Representation Learning on Large Graphscited by 6,320
  2. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  3. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
  4. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  5. 2016Variational Graph Auto-Encoderscited by 1,382
  6. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  7. 2022Rethinking Graph Neural Networks for Anomaly Detectioncited by 187
  8. 2014Graph-based Anomaly Detection and Description: A Surveycited by 183
  9. 2020River: machine learning for streaming data in Pythoncited by 98
  10. 2022Deep Isolation Forest for Anomaly Detectioncited by 92
  11. 2023Towards Self-Interpretable Graph-Level Anomaly Detectioncited by 41
  12. 2019MIDAS: Microcluster-Based Detector of Anomalies in Edge Streamscited by 29
8 more
  1. 2020F-FADE: Frequency Factorization for Anomaly Detection in Edge Streamscited by 26
  2. 2024SLADE: Detecting Dynamic Anomalies in Edge Streams without Labels via Self-Supervised Learningcited by 14
  3. 2020Mining Persistent Activity in Continually Evolving Networkscited by 13
  4. 2021Sketch-Based Anomaly Detection in Streaming Graphscited by 9
  5. 2020Real-Time Anomaly Detection in Edge Streamscited by 7
  6. 2023ADT: Agent-based Dynamic Thresholding for Anomaly Detectioncited by 5
  7. 2024Algorithmic Drift: A Simulation Framework to Study the Effects of Recommender Systems on User Preferencescited by 5
  8. 2016Optimal Thresholds for Anomaly-Based Intrusion Detection in Dynamical Environmentscited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.