NeiGAD: Augmenting Graph Anomaly Detection via Spectral Neighbor Information

• URL: http://arxiv.org/abs/2603.28300v1
• Date: Mon, 30 Mar 2026 11:26:56 GMT
• Title: NeiGAD: Augmenting Graph Anomaly Detection via Spectral Neighbor Information
• Abstract summary: NeiGAD is a novel plug-and-play module that captures neighbor information through spectral graph analysis.<n> Experiments on eight real-world datasets show that NeiGAD consistently improves detection accuracy and outperforms state-of-the-art GAD methods.
• Score: 40.02922664232736
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph anomaly detection (GAD) aims to identify irregular nodes or structures in attributed graphs. Neighbor information, which reflects both structural connectivity and attribute consistency with surrounding nodes, is essential for distinguishing anomalies from normal patterns. Although recent graph neural network (GNN)-based methods incorporate such information through message passing, they often fail to explicitly model its effect or interaction with attributes, limiting detection performance. This work introduces NeiGAD, a novel plug-and-play module that captures neighbor information through spectral graph analysis. Theoretical insights demonstrate that eigenvectors of the adjacency matrix encode local neighbor interactions and progressively amplify anomaly signals. Based on this, NeiGAD selects a compact set of eigenvectors to construct efficient and discriminative representations. Experiments on eight real-world datasets show that NeiGAD consistently improves detection accuracy and outperforms state-of-the-art GAD methods. These results demonstrate the importance of explicit neighbor modeling and the effectiveness of spectral analysis in anomaly detection. Code is available at: https://github.com/huafeihuang/NeiGAD.

Related papers

• NK-GAD: Neighbor Knowledge-Enhanced Unsupervised Graph Anomaly Detection [23.361428193356435]
  Real-world graphs often exhibit attribute-level heterophily, where connected nodes have dissimilar attributes.<n>We propose NK-GAD, a neighbor knowledge-enhanced unsupervised graph anomaly detection framework.<n> Experiments on seven datasets show NK-GAD achieves an average 3.29% AUC improvement.
  arXiv  Detail & Related papers  (2026-04-17T03:47:28Z)
• Graph-Based Fraud Detection with Dual-Path Graph Filtering [52.459703746017624]
  Fraud detection on graph data requires distinguishing between different types of nodes.<n>This paper proposes a Graph-Based Fraud Detection Model with Dual-Path Graph Filtering.<n>Experiments on four real-world financial fraud detection datasets demonstrate the effectiveness of our proposed method.
  arXiv  Detail & Related papers  (2026-04-14T20:46:36Z)
• 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)
• 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)
• Guarding Graph Neural Networks for Unsupervised Graph Anomaly Detection [16.485082741239808]
  Unsupervised graph anomaly detection aims at identifying rare patterns that deviate from the majority in a graph without the aid of labels.<n>Recent advances have utilized Graph Neural Networks (GNNs) to learn effective node representations.<n>We propose a framework for Guarding Graph Neural Networks for Unsupervised Graph Anomaly Detection (G3AD)
  arXiv  Detail & Related papers  (2024-04-25T07:09:05Z)
• Multitask Active Learning for Graph Anomaly Detection [48.690169078479116]
  We propose a novel MultItask acTIve Graph Anomaly deTEction framework, namely MITIGATE. By coupling node classification tasks, MITIGATE obtains the capability to detect out-of-distribution nodes without known anomalies. Empirical studies on four datasets demonstrate that MITIGATE significantly outperforms the state-of-the-art methods for anomaly detection.
  arXiv  Detail & Related papers  (2024-01-24T03:43:45Z)
• 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)
• GAD-NR: Graph Anomaly Detection via Neighborhood Reconstruction [34.82023223790515]
  Graph Auto-Encoders (GAEs) encode graph data into node representations and identify anomalies by assessing the reconstruction quality of the graphs based on these representations.<n>We propose GAD-NR, a new variant of GAE that incorporates neighborhood reconstruction for graph anomaly detection.<n>Extensive experimentation conducted on six real-world datasets validates the effectiveness of GAD-NR, showcasing significant improvements (by up to 30% in AUC) over state-of-the-art competitors.
  arXiv  Detail & Related papers  (2023-06-02T23:23:34Z)
• ARISE: Graph Anomaly Detection on Attributed Networks via Substructure Awareness [70.60721571429784]
  We propose a new graph anomaly detection framework on attributed networks via substructure awareness (ARISE) ARISE focuses on the substructures in the graph to discern abnormalities. Experiments show that ARISE greatly improves detection performance compared to state-of-the-art attributed networks anomaly detection (ANAD) algorithms.
  arXiv  Detail & Related papers  (2022-11-28T12:17:40Z)
• 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)
• Structural Temporal Graph Neural Networks for Anomaly Detection in Dynamic Graphs [54.13919050090926]
  We propose an end-to-end structural temporal Graph Neural Network model for detecting anomalous edges in dynamic graphs. In particular, we first extract the $h$-hop enclosing subgraph centered on the target edge and propose the node labeling function to identify the role of each node in the subgraph. Based on the extracted features, we utilize Gated recurrent units (GRUs) to capture the temporal information for anomaly detection.
  arXiv  Detail & Related papers  (2020-05-15T09:17:08Z)

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.