TL;DR
This paper introduces AD-GCL, a graph contrastive learning framework designed to improve anomaly detection robustness in networks with structural imbalance, especially for low-degree tail nodes.
Contribution
The paper proposes a novel GCL-based method with neighbor pruning and neighbor completion strategies to enhance tail anomaly detection in imbalanced graphs.
Findings
AD-GCL outperforms existing methods in detecting head and tail anomalies.
The framework improves robustness against structural imbalance.
Experimental results validate the effectiveness of the proposed strategies.
Abstract
The superiority of graph contrastive learning (GCL) has prompted its application to anomaly detection tasks for more powerful risk warning systems. Unfortunately, existing GCL-based models tend to excessively prioritize overall detection performance while neglecting robustness to structural imbalance, which can be problematic for many real-world networks following power-law degree distributions. Particularly, GCL-based methods may fail to capture tail anomalies (abnormal nodes with low degrees). This raises concerns about the security and robustness of current anomaly detection algorithms and therefore hinders their applicability in a variety of realistic high-risk scenarios. To the best of our knowledge, research on the robustness of graph anomaly detection to structural imbalance has received little scrutiny. To address the above issues, this paper presents a novel GCL-based framework…
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
