Multi-Head Spectral-Adaptive Graph Anomaly Detection

📅 2025-12-25
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
In graph-based anomaly detection—particularly for financial fraud—adversarial anomalies exhibit strong camouflage, and high-frequency discriminative signals are often smoothed out or lost by global graph filters. Method: We propose a spectral-fingerprint-driven dynamic graph learning framework tailored for financial fraud detection. First, we design a lightweight hypernetwork that dynamically generates multi-head Chebyshev filters per node based on its spectral fingerprint, enabling instance-adaptive spectral-domain modeling. Second, we introduce a multi-head decoupling mechanism combining Teacher–Student Contrastive (TSC) learning with Barlow Twins diversity regularization to enhance robust representation of anomaly-sensitive features. Results: Evaluated on four real-world heterogeneous graph datasets, our method consistently outperforms state-of-the-art approaches. Crucially, it preserves critical high-frequency anomaly signals under high heterogeneity, leading to improved detection accuracy and generalization.

Technology Category

Application Category

📝 Abstract
Graph anomaly detection technology has broad applications in financial fraud and risk control. However, existing graph anomaly detection methods often face significant challenges when dealing with complex and variable abnormal patterns, as anomalous nodes are often disguised and mixed with normal nodes, leading to the coexistence of homophily and heterophily in the graph domain. Recent spectral graph neural networks have made notable progress in addressing this issue; however, current techniques typically employ fixed, globally shared filters. This 'one-size-fits-all' approach can easily cause over-smoothing, erasing critical high-frequency signals needed for fraud detection, and lacks adaptive capabilities for different graph instances. To solve this problem, we propose a Multi-Head Spectral-Adaptive Graph Neural Network (MHSA-GNN). The core innovation is the design of a lightweight hypernetwork that, conditioned on a 'spectral fingerprint' containing structural statistics and Rayleigh quotient features, dynamically generates Chebyshev filter parameters tailored to each instance. This enables a customized filtering strategy for each node and its local subgraph. Additionally, to prevent mode collapse in the multi-head mechanism, we introduce a novel dual regularization strategy that combines teacher-student contrastive learning (TSC) to ensure representation accuracy and Barlow Twins diversity loss (BTD) to enforce orthogonality among heads. Extensive experiments on four real-world datasets demonstrate that our method effectively preserves high-frequency abnormal signals and significantly outperforms existing state-of-the-art methods, especially showing excellent robustness on highly heterogeneous datasets.
Problem

Research questions and friction points this paper is trying to address.

Detects disguised anomalies in graphs with mixed homophily and heterophily
Addresses over-smoothing from fixed filters in spectral graph neural networks
Adapts filtering strategies per node to preserve high-frequency fraud signals
Innovation

Methods, ideas, or system contributions that make the work stand out.

Dynamic Chebyshev filters via hypernetwork adaptation
Dual regularization with contrastive and diversity losses
Multi-head spectral-adaptive GNN for heterogeneous graphs
🔎 Similar Papers
💼 Related Jobs
No related jobs found.
Q
Qingyue Cao
People's Public Security University of China, Beijing, China
B
Bo Jin
Third Research Institute of the Ministry of Public Security, Shanghai, China
C
Changwei Gong
People's Public Security University of China, Beijing, China
X
Xin Tong
People's Public Security University of China, Beijing, China
W
Wenzheng Li
People's Public Security University of China, Beijing, China
X
Xiaodong Zhou
Shanghai Police College, Shanghai, China