Feature Transformation Enhanced Jacobi Polynomial Graph Filtering for Graph Anomaly Detection

• URL: http://arxiv.org/abs/2608.27144v1
• Date: Thu, 27 Aug 2026 13:57:09 GMT
• Title: Feature Transformation Enhanced Jacobi Polynomial Graph Filtering for Graph Anomaly Detection
• Abstract summary: Graph anomaly detection (GAD) based on frequency-domain filtering have achieved promising results.<n>Existing approaches face three major challenges: First, they use static basic function to constructed graph filter.<n>Second, they fail to adequately consider the importance information of each attribute in the node feature vector.<n>Third, they utilize node labels for GAD, leading to the loss of fine-grained information.
• Score: 17.594530405168445
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In recent years, graph anomaly detection (GAD) based on frequency-domain filtering have achieved promising results. However, existing approaches still face three major challenges: First, they use static basic function to constructed graph filter which cannot effectively adapt to the frequency-domain distribution of graph data. Second, they fail to adequately consider the importance information of each attribute in the node feature vector, leading to the loss of fine-grained information. Third, they insufficiently utilize node labels for GAD. To address these issues, this paper proposes a novel graph anomaly detection method called JPGFN (Feature Transformation Enhanced Jacobi Polynomial Graph Filtering Network). First, a Feature Separation Transformation Network (FSTNN) is developed to better learn fine-grained node features by feature separation and applying nonlinear transformations to node features across different dimensions. Second, an adaptive Jacobi polynomial graph filtering module is constructed based on Jacobi polynomials to adaptively capture complex frequency-domain features of graph signals. Finally, a node label constraint module is developed to facilitate the use of node labels and enhance the performance of GAD. Experimental results on multiple real-world datasets demonstrate that the proposed method significantly outperforms mainstream approaches.

Related papers

• Generative Diffusion Models of Stochastic Graph Signals [74.4097723209053]
  This paper tackles problems of conditional graph signal generative modeling and tackles them with a single denoising diffusion framework.<n>We learn a reverse diffusion process, parametrized by graph neural networks (GNNs), that draws graph signals conditioned directly on the graph topology and on node-feature side information.<n>We demonstrate our method on two generative tasks: stock price forecasting and optimal wireless resource allocation, with extensive numerical results in both domains.
  arXiv  Detail & Related papers  (2026-07-07T22:02:13Z)
• 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)
• Partition-wise Graph Filtering: A Unified Perspective Through the Lens of Graph Coarsening [15.198274855557132]
  This paper introduces Coarsening-guided Partition-wise Filtering (CPF)<n>CPF innovates by performing filtering on node partitions.<n>In-depth analysis is conducted for each phase of CPF, showing its superiority over other paradigms.
  arXiv  Detail & Related papers  (2025-05-20T07:30:45Z)
• Deep Manifold Graph Auto-Encoder for Attributed Graph Embedding [51.75091298017941]
  This paper proposes a novel Deep Manifold (Variational) Graph Auto-Encoder (DMVGAE/DMGAE) for attributed graph data. The proposed method surpasses state-of-the-art baseline algorithms by a significant margin on different downstream tasks across popular datasets.
  arXiv  Detail & Related papers  (2024-01-12T17:57:07Z)
• 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)
• Adaptive Filters in Graph Convolutional Neural Networks [0.0]
  Graph Neural Networks (GNN) have gained a high interest because of their potential in processing graph-structured data. This paper presents a novel method to adapt the behaviour of a ConvGNN to the input proposing a method to perform spatial convolution on graphs.
  arXiv  Detail & Related papers  (2021-05-21T14:36:39Z)
• Graph Neural Networks with Adaptive Frequency Response Filter [55.626174910206046]
  We develop a graph neural network framework AdaGNN with a well-smooth adaptive frequency response filter. We empirically validate the effectiveness of the proposed framework on various benchmark datasets.
  arXiv  Detail & Related papers  (2021-04-26T19:31:21Z)
• Pseudoinverse Graph Convolutional Networks: Fast Filters Tailored for Large Eigengaps of Dense Graphs and Hypergraphs [0.0]
  Graph Convolutional Networks (GCNs) have proven to be successful tools for semi-supervised classification on graph-based datasets. We propose a new GCN variant whose three-part filter space is targeted at dense graphs.
  arXiv  Detail & Related papers  (2020-08-03T08:48:41Z)
• Adaptive Graph Encoder for Attributed Graph Embedding [36.06427854846497]
  Attributed graph embedding learns vector representations from graph topology and node features. We propose Adaptive Graph (AGE), a novel attributed graph embedding framework. We conduct experiments using four public benchmark datasets to validate AGE on node clustering and link prediction tasks.
  arXiv  Detail & Related papers  (2020-07-03T10:20:34Z)
• 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.