Anomaly Detection in Financial Transactions Via Graph-Based Feature Aggregations

被引:1
作者
Wang, Hewen [1 ]
Yang, Renchi [2 ]
Shi, Jieming [3 ]
机构
[1] Natl Univ Singapore, Singapore, Singapore
[2] Hong Kong Baptist Univ, Kowloon Tong, Hong Kong, Peoples R China
[3] Hong Kong Polytech Univ, Hung Hom, Hong Kong, Peoples R China
来源
BIG DATA ANALYTICS AND KNOWLEDGE DISCOVERY, DAWAK 2023 | 2023年 / 14148卷
关键词
Anomaly Detection; Financial Transaction Network; Graph Embedding;
D O I
10.1007/978-3-031-39831-5_6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Anomaly detection in the financial domain aims to detect abnormal transactions such as fraudulent transactions that can lead to loss of revenues to financial institutions. Existing solutions utilize solely transaction attributes as feature representations without the consideration of direct/indirect interactions between users and transactions, leading to limited accuracy. We formulate anomaly detection in financial transactions as the problem of edge classification in an edge-attributed multigraph, where each transaction is regarded as an edge, and each user is represented by a node. Then, we propose an effective solution DoubleFA, which contains two novel schemes: proximal feature aggregation and anomaly feature aggregation. The former is to aggregate features from neighborhoods into edges based on top-k Personalized PageRank (PPR). In anomaly feature aggregation, we employ a predict-and-aggregate strategy to accurately preserve anomaly information, thereby alleviating the over-smoothing issue incurred by proximal feature aggregation. Our experiments comparing DoubleFA against 10 baselines on real transaction datasets from PayPal demonstrate that DoubleFA consistently outperforms all baselines in terms of anomaly detection accuracy. In particular, on the full PayPal dataset with 160 million users and 470 million transactions, our method achieves a significant improvement of at least 23% in F1 score compared to the best competitors.
引用
收藏
页码:64 / 79
页数:16
相关论文
共 33 条
  • [1] Fast low-rank modifications of the thin singular value decomposition
    Brand, M
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 415 (01) : 20 - 30
  • [2] XGBoost: A Scalable Tree Boosting System
    Chen, Tianqi
    Guestrin, Carlos
    [J]. KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 785 - 794
  • [3] Adversarial Training Methods for Network Embedding
    Dai, Quanyu
    Shen, Xiao
    Zhang, Liang
    Li, Qiang
    Wang, Dan
    [J]. WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 329 - 339
  • [4] Goldstein M., 2012, KI-2012: Poster and Demo Track, P59
  • [5] dyngraph2vec: Capturing network dynamics using dynamic graph representation learning
    Goyal, Palash
    Chhetri, Sujit Rokka
    Canedo, Arquimedes
    [J]. KNOWLEDGE-BASED SYSTEMS, 2020, 187
  • [6] node2vec: Scalable Feature Learning for Networks
    Grover, Aditya
    Leskovec, Jure
    [J]. KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 855 - 864
  • [7] Hamilton WL, 2017, ADV NEUR IN, V30
  • [8] Hu BB, 2019, AAAI CONF ARTIF INTE, P946
  • [9] Jeh G., 2003, P 12 INT C WORLD WID, P271
  • [10] Klicpera Johannes, 2019, ICLR