Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Kim, Heehyeon, Choi, Jinhyeok, Whang, Joyce Jiyoung
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913183965380608
author Kim, Heehyeon
Choi, Jinhyeok
Whang, Joyce Jiyoung
author_facet Kim, Heehyeon
Choi, Jinhyeok
Whang, Joyce Jiyoung
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2310_04171
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection
Kim, Heehyeon
Choi, Jinhyeok
Whang, Joyce Jiyoung
Machine Learning
Artificial Intelligence
Cryptography and Security
I.2
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.
title Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection
topic Machine Learning
Artificial Intelligence
Cryptography and Security
I.2
url https://arxiv.org/abs/2310.04171