SmoothGNN: Smoothing-aware GNN for Unsupervised Node Anomaly Detection
Xiangyu Dong, Xingyi Zhang, Yanni Sun, Lei Chen, Mingxuan Yuan, Sibo, Wang

TL;DR
SmoothGNN introduces a smoothing-aware framework that leverages unique node smoothing patterns to improve unsupervised node anomaly detection, achieving superior accuracy and efficiency on multiple datasets.
Contribution
The paper proposes a novel unsupervised NAD framework, SmoothGNN, utilizing explicit and implicit learning of smoothing patterns to enhance anomaly detection performance.
Findings
Outperforms rivals by 14.66% in AUC and 7.28% in AP.
Achieves 75x faster runtime than existing methods.
Identifies unique smoothing patterns that distinguish anomalous nodes.
Abstract
The smoothing issue in graph learning leads to indistinguishable node representations, posing significant challenges for graph-related tasks. However, our experiments reveal that this problem can uncover underlying properties of node anomaly detection (NAD) that previous research has missed. We introduce Individual Smoothing Patterns (ISP) and Neighborhood Smoothing Patterns (NSP), which indicate that the representations of anomalous nodes are harder to smooth than those of normal ones. In addition, we explore the theoretical implications of these patterns, demonstrating the potential benefits of ISP and NSP for NAD tasks. Motivated by these findings, we propose SmoothGNN, a novel unsupervised NAD framework. First, we design a learning component to explicitly capture ISP for detecting node anomalies. Second, we design a spectral graph neural network to implicitly learn ISP to enhance…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnomaly Detection Techniques and Applications
MethodsGraph Neural Network
