Skip to content
Book Open access

CR-Aug: Community Risk-Guided Adaptive Augmentation for Semi-supervised Graph Anomaly Detection

Aug 2026 · Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2 · pp. 1862-1873 · 0 citations · 23 references

Abstract

Recently, semi-supervised graph anomaly detection (GAD) has garnered increasing attention under a challenging setting where only a limited number of normal nodes are labeled during training. To better exploit the limited normal supervision and compensate for the absence of real anomaly labels, existing methods often adopt a single, uniform anomaly modeling and pseudo-anomaly generation strategy applied across the entire graph, while overlooking the inherent heterogeneity among communities in graph data. Consequently, the generated pseudo-anomalies exhibit limited diversity and specificity, failing to represent the complex distributions of real-world anomalies. To address this challenge, we propose CR-Aug, a novel Community Risk-Guided Adaptive Augmentation framework, which is designed to overcome this limitation by leveraging community-specific prior knowledge more effectively. It comprises two core components: Community Risk Profiling (CRP) and Risk-Guided Synthesis (RGS). Specifically, CRP quantifies community-level risks by measuring the affinity discrepancy between the labeled normal subset and the overall community. Guided by the derived risk scores, RGS then dynamically adapts the generation process through risk-weighted sampling and adaptive mixing. This strategy facilitates the synthesis of diverse pseudo-anomalies, thereby providing the classifier with more discriminative supervisory signals. Extensive experiments on multiple benchmark datasets demonstrate that CR-Aug significantly outperforms state-of-the-art semi-supervised GAD methods, validating the effectiveness of incorporating community-level risk profiles.

Read PDF

Similar papers

Open access Aug 2026

Generate and Filter: A GNN-Based Approach for Graph Anomaly Detection

A novel framework, Generate and Filter graph learning for Graph Anomaly Detection (GFGAD), which generates a diverse set of synthetic anomalies with enriched feature and structural information to balance the data distribution and significantly outperforms state-of-the-art baselines.

Meng-Yu Li, Yong-Hao Liu, Xi-Ming Li et al. · 0 citations
Open access Aug 2026

PRA-TAM: prototype-regularised residual affinity maximisation for unsupervised graph anomaly detection

A novel framework, prototype-regularised residual affinity maximisation (PRA-TAM), for unsupervised graph anomaly detection is proposed, computationally efficient, scalable, and well-suited to real-world graph anomaly detection applications characterised by complex, heterogeneous data distributions.

Wasim Khan, Sujit R. Wakchaure, Girisha R. Bombale et al. · 0 citations
Open access Aug 2026

Dual-autoencoder multi-task self-supervised one-class graph anomaly detection for network traffic

GDAE is proposed, a multi-task self-supervised one-class anomaly detection framework for network traffic graphs, with strong stability and efficiency, offering a new pathway for lightweight, robust self-supervised one-class intrusion detection.

Ji Zhao, Da-Min Zhang, Tian-Yi Wang et al. · 0 citations
Book Open access Jul 2026

Retrieval-Augmented Contrastive Learning for Dynamic Graph Anomaly Detection

DGRA-CL transforms dynamic graphs into temporal sequences, employs time- and context-aware contrastive learning to learn normal node behavior patterns, retrieves similar normal exemplars from a training pool under a strict causality constraint, and fuses them via similarity-weighted aggregation to construct baseline re...

Kamal Berahmand, S. Forouzandeh, Mehrnoush Mohammadi et al. · 2 citations
Open access Aug 2026

TGPA: Transferable graph prompt attack with hierarchical subgraph augmentation.

A novel transferable graph prompt attack, called TGPA, is proposed, which shifts the attack paradigm by introducing a hierarchical structural decoupling mechanism, which reduces the performance of pre-trained graph models with graph prompts by up to 28.9%, while guaranteeing robustness, stealthiness, and transferabilit...

Ju Jia, Haonan Wang, Tian Wu et al. · 0 citations
Conference Open access Sep 2026

Unsupervised Anomaly Detection in Dynamic Graphs via Compatibility Modeling and Boundary Learning

BAD is proposed, an unsupervised framework for anomaly detection in continuous-time dynamic graphs that represents nodes with learnable identity embeddings and performs pairwise compatibility modeling via cross-attention between each destination node and the source’s recent neighbors, enabling direct characterization o...

Jia-Chi Luo, Sha-Meng Wen, Zi-Yan Qiu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.