Multi-Head Spectral-Adaptive Graph Anomaly Detection

• URL: http://arxiv.org/abs/2512.22291v1
• Date: Thu, 25 Dec 2025 14:55:43 GMT
• Title: Multi-Head Spectral-Adaptive Graph Anomaly Detection
• Authors: Qingyue Cao, Bo Jin, Changwei Gong, Xin Tong, Wenzheng Li, Xiaodong Zhou,
• Abstract summary: Graph anomaly detection has broad applications in financial fraud and risk control.<n>Existing graph anomaly detection methods often face significant challenges when dealing with complex and variable abnormal patterns.<n>We propose a Multi-Head Spectral-Adaptive Graph Neural Network (MHSA-GNN)<n>Our method effectively preserves high-frequency abnormal signals and significantly outperforms existing state-of-the-art methods.
• Score: 7.788514265469946
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Meta-Learning Based Few-Shot Graph-Level Anomaly Detection [6.216246253868536]
  Graph-level anomaly detection plays a vital role in various fields such as fraud detection, review classification, and biochemistry.<n>Existing methods rely heavily on large amounts of labeled data, which is often unavailable in real-world scenarios.<n>We propose a novel meta-learning-based graph-level anomaly detection framework (MA-GAD)<n>MA-GAD incorporates a graph compression module that reduces the graph size, mitigating noise interference while retaining essential node information.
  arXiv  Detail & Related papers  (2025-10-09T06:45:07Z)
• Addressing Graph Anomaly Detection via Causal Edge Separation and Spectrum [6.722106415172189]
  In the real world, anomalous entities often add more legitimate connections while hiding direct links with other anomalous entities.<n>This study analyzes the spectral distribution of nodes with different heterophilic degrees and discovers that the heterophily of anomalous nodes causes the spectral energy to shift.<n>We propose a spectral neural network CES2-GAD based on causal edge separation for anomaly detection on heterophilic graphs.
  arXiv  Detail & Related papers  (2025-08-20T12:59:22Z)
• Unsupervised Graph Anomaly Detection via Multi-Hypersphere Heterophilic Graph Learning [7.277472116667557]
  Graph Anomaly (GAD) plays a vital role in various data mining applications such as e-commerce fraud prevention and malicious user detection.<n>We propose a Heterophilic Graph Detection (HGE) module to learn distinguishable abnormal representations for potential anomalies.<n>Then, we propose a Multi-Hypersphere Learning (MHL) module to enhance the detection capability for context-dependent anomalies.
  arXiv  Detail & Related papers  (2025-03-15T08:08:13Z)
• UMGAD: Unsupervised Multiplex Graph Anomaly Detection [40.17829938834783]
  We propose a novel Unsupervised Multiplex Graph Anomaly Detection method, named UMGAD.<n>We first learn multi-relational correlations among nodes in multiplex heterogeneous graphs.<n>Then, to further extract abnormal information, we generate attribute-level and subgraph-level augmented-view graphs.
  arXiv  Detail & Related papers  (2024-11-19T15:15:45Z)
• Dual-Frequency Filtering Self-aware Graph Neural Networks for Homophilic and Heterophilic Graphs [60.82508765185161]
  We propose Dual-Frequency Filtering Self-aware Graph Neural Networks (DFGNN) DFGNN integrates low-pass and high-pass filters to extract smooth and detailed topological features. It dynamically adjusts filtering ratios to accommodate both homophilic and heterophilic graphs.
  arXiv  Detail & Related papers  (2024-11-18T04:57:05Z)
• GrassNet: State Space Model Meets Graph Neural Network [57.62885438406724]
  Graph State Space Network (GrassNet) is a novel graph neural network with theoretical support that provides a simple yet effective scheme for designing arbitrary graph spectral filters. To the best of our knowledge, our work is the first to employ SSMs for the design of graph GNN spectral filters. Extensive experiments on nine public benchmarks reveal that GrassNet achieves superior performance in real-world graph modeling tasks.
  arXiv  Detail & Related papers  (2024-08-16T07:33:58Z)
• Detecting Anomalies in Dynamic Graphs via Memory enhanced Normality [39.476378833827184]
  Anomaly detection in dynamic graphs presents a significant challenge due to the temporal evolution of graph structures and attributes. We introduce a novel spatial- temporal memories-enhanced graph autoencoder (STRIPE) STRIPE significantly outperforms existing methods with 5.8% improvement in AUC scores and 4.62X faster in training time.
  arXiv  Detail & Related papers  (2024-03-14T02:26:10Z)
• Alleviating Structural Distribution Shift in Graph Anomaly Detection [70.1022676681496]
  Graph anomaly detection (GAD) is a challenging binary classification problem. Gallon neural networks (GNNs) benefit the classification of normals from aggregating homophilous neighbors. We propose a framework to mitigate the effect of heterophilous neighbors and make them invariant.
  arXiv  Detail & Related papers  (2024-01-25T13:07:34Z)
• ADA-GAD: Anomaly-Denoised Autoencoders for Graph Anomaly Detection [84.0718034981805]
  We introduce a novel framework called Anomaly-Denoised Autoencoders for Graph Anomaly Detection (ADA-GAD) In the first stage, we design a learning-free anomaly-denoised augmentation method to generate graphs with reduced anomaly levels. In the next stage, the decoders are retrained for detection on the original graph.
  arXiv  Detail & Related papers  (2023-12-22T09:02:01Z)
• BOURNE: Bootstrapped Self-supervised Learning Framework for Unified Graph Anomaly Detection [50.26074811655596]
  We propose a novel unified graph anomaly detection framework based on bootstrapped self-supervised learning (named BOURNE) By swapping the context embeddings between nodes and edges, we enable the mutual detection of node and edge anomalies. BOURNE can eliminate the need for negative sampling, thereby enhancing its efficiency in handling large graphs.
  arXiv  Detail & Related papers  (2023-07-28T00:44:57Z)
• From Unsupervised to Few-shot Graph Anomaly Detection: A Multi-scale Contrastive Learning Approach [26.973056364587766]
  Anomaly detection from graph data is an important data mining task in many applications such as social networks, finance, and e-commerce. We propose a novel framework, graph ANomaly dEtection framework with Multi-scale cONtrastive lEarning (ANEMONE in short) By using a graph neural network as a backbone to encode the information from multiple graph scales (views), we learn better representation for nodes in a graph.
  arXiv  Detail & Related papers  (2022-02-11T09:45:11Z)
• Deep Graph-level Anomaly Detection by Glocal Knowledge Distillation [61.39364567221311]
  Graph-level anomaly detection (GAD) describes the problem of detecting graphs that are abnormal in their structure and/or the features of their nodes. One of the challenges in GAD is to devise graph representations that enable the detection of both locally- and globally-anomalous graphs. We introduce a novel deep anomaly detection approach for GAD that learns rich global and local normal pattern information by joint random distillation of graph and node representations.
  arXiv  Detail & Related papers  (2021-12-19T05:04:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.