arXiv Machine Learning By Simone Mungari, Albert Bifet, Giuseppe Manco, Bernhard Pfahringer

ARES: Anomaly Recognition Model For Edge Streams

Read the original on arXiv Machine Learning →

arXiv:2511. 22078v2 Announce Type: replace Abstract: Many real-world scenarios involving streaming information can be represented as temporal graphs, where data flows through dynamic changes in edges over time.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Machine Learning
Sep 22

Clustering-Based Collective Anomaly Detection in IoT Systems: A Graph Neural Network Approach

The paper introduces Unsupervised Graph Collective Anomaly Detection (UGCAD), a framework that uses a variational graph autoencoder to learn graph representations of IoT network traffic and then enhances clustering to group nodes. UGCAD identifies collective anomalies by aggregating normal clusters and applying anomaly scores to the refined groups. Experiments on CICIoT2023 and ToN-IoT datasets show that UGCAD outperforms traditional and state‑of‑the‑art clustering‑based CAD methods in both clustering quality and anomaly detection accuracy.

By Dalila Khettaf, Djamel Djenouri, Zeinab Rezaeifar, Youcef Djenouri
arXiv Machine Learning
Sep 17

FoundAna: A GNN-assisted Foundation Model for Graph Anomaly Detection

FoundAna is a GNN‑assisted foundation model designed for graph anomaly detection across diverse datasets. It combines a GNN component with a transformer encoder enhanced by four positional encodings to capture both local and global structure, using reconstruction errors as anomaly scores. Experiments on nine benchmark datasets from financial, social, and citation networks show that FoundAna consistently outperforms state‑of‑the‑art baselines.

By Suprim Nakarmi, Chahana Dahal, Yue Zhao, Junggab Son, Zuobin Xiong
arXiv Machine Learning
Sep 4

Statistical Feature Augmentation for Anomaly Detection in Dynamic Graphs

The paper introduces a statistical feature augmentation technique that encodes behavioral interaction statistics into the input space for dynamic graph anomaly detection. Experiments on Reddit, Wikipedia, and MOOC datasets across seven models—both continuous-time and discrete-time—show that this augmentation consistently improves detection performance compared to models trained on original embeddings. The enriched input also facilitates fine-grained post-hoc analysis of behavioral importance, linking classical network analysis with deep learning.

By Philipp Schlinge, Jean-Luc Schnipper, Martin Atzmueller