Graph computing models show great popularity in tracking the fraud detection problem defending merchant losses with illegal behaviors. However, current solutions mainly focus on capturing features of user historical behavior sequences with supervised learning, which makes it difficult to cope with the vagaries of fraud patterns. To gain a lot of traction, this paper proposes a novel PARallel Graph Computing model for Unsupervised Fraud Detection (PAR-GCUFD). The unsupervised graph construction and graph contrastive learning are developed to effectively identify unseen fraud patterns. Furthermore, we innovatively design a parallel strategy to accelerate the speed of training and inference. Extensive experiments on real-world industrial datasets also prove the superiority of the proposed PAR-GCUFD framework.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Novel Parallel Graph Computing Model for Unsupervised Fraud Detection

  • Jiahui Wang,
  • Rui Sun,
  • Fangshu Chen,
  • Wei Zhang,
  • Panpan Feng,
  • Chengcheng Yu

摘要

Graph computing models show great popularity in tracking the fraud detection problem defending merchant losses with illegal behaviors. However, current solutions mainly focus on capturing features of user historical behavior sequences with supervised learning, which makes it difficult to cope with the vagaries of fraud patterns. To gain a lot of traction, this paper proposes a novel PARallel Graph Computing model for Unsupervised Fraud Detection (PAR-GCUFD). The unsupervised graph construction and graph contrastive learning are developed to effectively identify unseen fraud patterns. Furthermore, we innovatively design a parallel strategy to accelerate the speed of training and inference. Extensive experiments on real-world industrial datasets also prove the superiority of the proposed PAR-GCUFD framework.