@article{Wang2026, 
author = {Xiao Wang and Tianyu Liu and Tonghong Chong and Guangquan Xu and Tuoyu Chen and Neal N. Xiong and Xiaohu Ye and Tiejun Wu},
title = {FD-GNN: Feature Decomposition Graph Neural Network for Anomaly Detection},
year = {2026},
journal = {Big Data Mining and Analytics},
volume = {9},
number = {3},
pages = {805-820},
keywords = {machine learning, anomaly detection, Graph Neural Network (GNN)},
url = {https://www.sciopen.com/article/10.26599/BDMA.2025.9020087},
doi = {10.26599/BDMA.2025.9020087},
abstract = {The objective of multidimensional graph fraud detection is to identify fraudulent entities within a graph. Graph Neural Network (GNN) models leverage graph structures to propagate messages from neighbors to target nodes, thereby obtaining precise representations of the target nodes. However, anomaly detection methods based on GNNs face challenges, such as structural inconsistency and over-smoothing, which reduce the suspicion scores of fraudulent nodes and hinder the effectiveness of anomaly detection models. To address these issues, we propose an end-to-end anomaly node detection model named Feature Decomposition Graph Neural Network (FD-GNN). In FD-GNN, a feature amplification module is first employed to enhance the differences between node representations. Then, a feature decomposition module is used to distinguish the natural attributes of nodes from their neighborhood attributes, with constraints applied to both types of attributes. Finally, a representation aggregation module utilizes differential aggregation operations to further distinguish normal nodes from anomaly ones. Experiments conducted on two real-world datasets, Amazon and YelpChi, demonstrate that FD-GNN achieves Area Under Curve (AUC) scores of 94.45% and 91.62%, respectively, outperforming existing multidimensional graph anomaly detection models.}
}