CDifOD: mitigating class imbalance in graph outlier detection through context- and category-aware diffusion

Graph-based outlier detection has gained significant attention due to its applications in security, finance, and social networks. However, the highly imbalanced nature of outlier datasets poses a fundamental challenge, leading to biased learning and suboptimal generalization. Existing strategies, including sampling-based techniques and loss reweighting, often fail to capture the intricate distribution of outliers in graph structures. To address this, we propose CDifOD, a context- and category-aware diffusion-based augmentation framework that generates realistic synthetic outliers to enhance model training. Specifically, we first apply graph clustering to partition large graphs into subgraphs, improving computational efficiency while preserving structural dependencies. Next, a GraphMAE-based encoder-decoder constructs a robust latent space for high-quality outlier generation. Finally, we introduce a context and category-aware conditioning strategy, where masked graph structures provide structural priors, and outlier labels guide the generative process to ensure realistic outlier synthesis. By integrating these components, CDifOD produces more balanced training data, mitigating class imbalance effectively. Extensive experiments on multiple benchmark datasets demonstrate that CDifOD consistently outperforms existing methods, yielding significant improvements in graph outlier detection.

Authors

Institutions

Publication Details

Journal
Social Network Analysis and Mining
Published
2026-06-17
DOI
https://doi.org/10.1007/s13278-026-01613-4
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CDifOD: mitigating class imbalance in graph outlier detection through context- and category-aware diffusion

H M Wang, Hanbin Lu
Social Network Analysis and Mining
Advanced Graph Neural Networks
article

CDifOD: mitigating class imbalance in graph outlier detection through context- and category-aware diffusion

H M Wang, Hanbin Lu
article en

Abstract

Graph-based outlier detection has gained significant attention due to its applications in security, finance, and social networks. However, the highly imbalanced nature of outlier datasets poses a fundamental challenge, leading to biased learning and suboptimal generalization. Existing strategies, including sampling-based techniques and loss reweighting, often fail to capture the intricate distribution of outliers in graph structures. To address this, we propose CDifOD, a context- and category-aware diffusion-based augmentation framework that generates realistic synthetic outliers to enhance model training. Specifically, we first apply graph clustering to partition large graphs into subgraphs, improving computational efficiency while preserving structural dependencies. Next, a GraphMAE-based encoder-decoder constructs a robust latent space for high-quality outlier generation. Finally, we introduce a context and category-aware conditioning strategy, where masked graph structures provide structural priors, and outlier labels guide the generative process to ensure realistic outlier synthesis. By integrating these components, CDifOD produces more balanced training data, mitigating class imbalance effectively. Extensive experiments on multiple benchmark datasets demonstrate that CDifOD consistently outperforms existing methods, yielding significant improvements in graph outlier detection.

Social Network Analysis and Mining
Southeast University (CN)
Openalex Percentile: Top 5%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.