Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection

Heehyeon Kim, Jinhyeok Choi, Joyce Jiyoung Whang
10/6/2023
cs.LGcs.AIcs.CR

No official code found. Best implementation: bdi-lab/DRAG (27 stars, last commit 2024-11-15).

Abstract

Fraud detection aims to discover fraudsters deceiving other users by, for example, leaving fake reviews or making abnormal transactions. Graph-based fraud detection methods consider this task as a classification problem with two classes: frauds or normal. We address this problem using Graph Neural Networks (GNNs) by proposing a dynamic relation-attentive aggregation mechanism. Based on the observation that many real-world graphs include different types of relations, we propose to learn a node representation per relation and aggregate the node representations using a learnable attention function that assigns a different attention coefficient to each relation. Furthermore, we combine the node representations from different layers to consider both the local and global structures of a target node, which is beneficial to improving the performance of fraud detection on graphs with heterophily. By employing dynamic graph attention in all the aggregation processes, our method adaptively computes the attention coefficients for each node. Experimental results show that our method, DRAG, outperforms state-of-the-art fraud detection methods on real-world benchmark datasets.

View on arXivView PDF

Code Implementations(1)

bdi-lab/DRAGCommunity64%

Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection (ICDMW 2023)

2718Python, Jupyter NotebookSep 29, 20231 years agoNOASSERTION

Similar Papers

Cite this paper

@article{kim2023dynamic,
  title  = {Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection},
  author = {Heehyeon Kim and Jinhyeok Choi and Joyce Jiyoung Whang},
  year   = {2023},
  eprint = {2310.04171},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.04171v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.04171.svg)](https://codeofpaper.com/paper/2310.04171)

Discussion