TL;DR
This paper presents a weakly supervised graph anomaly detection method that uses synthetic anomalies and multi-task learning to improve feature representations, achieving superior results on public datasets.
Contribution
It introduces a domain-specific feature learning strategy with synthetic anomalies and a two-phase training scheme for enhanced graph anomaly detection.
Findings
Outperforms existing methods on public datasets
Synthetic anomalies improve feature sensitivity to deviations
Two-phase training balances synthetic and real data influence
Abstract
Weakly supervised graph anomaly detection aims to unveil unusual graph instances, e.g., nodes, whose behaviors significantly differ from normal ones, given only a limited number of annotated anomalies and abundant unlabeled samples. A major challenge is to learn a meaningful latent feature representation that reduces intra-class variance among normal data while remaining highly sensitive to anomalies. Although recent works have applied self-supervised feature learning for graph anomaly detection, their strategies are not specifically tailored to its unique requirements, motivating our exploration of a more domain-specific approach. In this paper, we introduce a weakly supervised graph anomaly detection method that leverages a feature learning strategy tailored for graph anomalies. Our approach is built upon a multi-task learning scheme that extracts robust feature representations…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
