LGSIOct 4, 2021

Deep Fraud Detection on Non-attributed Graph

arXiv:2110.01171v121 citations
Originality Incremental advance
AI Analysis

This addresses the problem of scarce labeled data and limited features in industrial fraud detection, though it is incremental as it builds on existing GNN methods.

The paper tackles fraud detection on graphs with limited node features and labels by proposing a graph transformation method and a contrastive pre-training strategy, achieving effective results on a large-scale industrial dataset.

Fraud detection problems are usually formulated as a machine learning problem on a graph. Recently, Graph Neural Networks (GNNs) have shown solid performance on fraud detection. The successes of most previous methods heavily rely on rich node features and high-fidelity labels. However, labeled data is scarce in large-scale industrial problems, especially for fraud detection where new patterns emerge from time to time. Meanwhile, node features are also limited due to privacy and other constraints. In this paper, two improvements are proposed: 1) We design a graph transformation method capturing the structural information to facilitate GNNs on non-attributed fraud graphs. 2) We propose a novel graph pre-training strategy to leverage more unlabeled data via contrastive learning. Experiments on a large-scale industrial dataset demonstrate the effectiveness of the proposed framework for fraud detection.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes