Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Deep Fraud Detection on Non-attributed Graph (2110.01171v1)

Published 4 Oct 2021 in cs.LG and cs.SI

Abstract: 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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (6)
  1. Chen Wang (600 papers)
  2. Yingtong Dou (19 papers)
  3. Min Chen (200 papers)
  4. Jia Chen (85 papers)
  5. Zhiwei Liu (114 papers)
  6. Philip S. Yu (592 papers)
Citations (18)

Summary

We haven't generated a summary for this paper yet.