.png){kind=icon}
返回
Improving fraud detection via imbalanced graph structure learning
.png){kind=icon}
PRE
AI
DOI：10.1007/s10994-023-06464-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graph-based fraud detection methods have recently attracted much attention due to the rich relational information of graph-structured data, which may facilitate the detection of fraudsters. However, the GNN-based algorithms may exhibit unsatisfactory performance faced with graph heterophily as the fraudsters usually disguise themselves by deliberately making extensive connections to normal users. In addition to this, the class imbalance problem also causes GNNs to overfit normal users and perform poorly for fraudsters. To address these problems, we propose an Imbalanced Graph Structure Learning framework for fraud detection (IGSL for short). Specifically, nodes are picked with a devised multi-relational class-balanced sampler for mini-batch training. Then, an iterative graph structure learning module is proposed to iteratively construct a global homophilic adjacency matrix in the embedding domain. Further, an anchor node message passing mechanism is proposed to reduce the computational complexity of the constructing homophily adjacency matrix. Extensive experiments on benchmark datasets show that IGSL achieves significantly better performance even when the graph is heavily heterophilic and imbalanced.
Keyword:
Fraud detection
Graph structure learning
Homophily
Heterophily
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
Glycosylating Effectors of Legionella pneumophila: Finding the Sweet Spots for Host Cell Subversion.png)
Biomolecules
OAAI
BiomoleculesIF0
OAAI分享收藏The impact of class imbalance in classification performance metrics based on the binary confusion matrixPATTERN RECOGNITION
OAAI
PATTERN RECOGNITIONIF7.6
OAAI分享收藏Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation基于图划分和图神经网络的层次图匹配图相似度计算NEUROCOMPUTINGOAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏
查看更多内容