2000 character limit reached
Dynamic Relation-Attentive Graph Neural Networks for Fraud Detection
Published 6 Oct 2023 in cs.LG, cs.AI, and cs.CR | (2310.04171v3)
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.
- X. Ma, J. Wu, S. Xue, J. Yang, C. Zhou, Q. Z. Sheng, H. Xiong, and L. Akoglu, “A comprehensive survey on graph anomaly detection with deep learning,” IEEE Transactions on Knowledge and Data Engineering, 2021.
- K. Liu, Y. Dou, Y. Zhao, X. Ding, X. Hu, R. Zhang, K. Ding, C. Chen, H. Peng, K. Shu, L. Sun, J. Li, G. H. Chen, Z. Jia, and P. S. Yu, “Bond: Benchmarking unsupervised outlier node detection on static attributed graphs,” in Proceedings of the 36th International Conference on Neural Information Processing Systems, 2022, pp. 27 021–27 035.
- S. Rayana and L. Akoglu, “Collective opinion spam detection: Bridging review networks and metadata,” in Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015, p. 985–994.
- A. Mukherjee, V. Venkataraman, B. Liu, and N. Glance, “What yelp fake review filter might be doing?” in Proceedings of the 7th International AAAI Conference on Weblogs and Social Media, 2013, pp. 409–418.
- Z. Qin, Y. Liu, Q. He, and X. Ao, “Explainable graph-based fraud detection via neural meta-graph search,” in Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022, p. 4414–4418.
- Q. Li, Y. He, C. Xu, F. Wu, J. Gao, and Z. Li, “Dual-augment graph neural network for fraud detection,” in Proceedings of the 31st ACM International Conference on Information & Knowledge Management, 2022, p. 4188–4192.
- F. Shi, Y. Cao, Y. Shang, Y. Zhou, C. Zhou, and J. Wu, “H2-fdetector: A gnn-based fraud detector with homophilic and heterophilic connections,” in Proceedings of the ACM Web Conference 2022, 2022, p. 1486–1494.
- Z. Liu, Y. Dou, P. S. Yu, Y. Deng, and H. Peng, “Alleviating the inconsistency problem of applying graph neural network to fraud detection,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2020, p. 1569–1572.
- Y. Gao, X. Wang, X. He, Z. Liu, H. Feng, and Y. Zhang, “Alleviating structural distribution shift in graph anomaly detection,” in Proceedings of the 16th ACM International Conference on Web Search and Data Mining, 2023, p. 357–365.
- M. Huang, Y. Liu, X. Ao, K. Li, J. Chi, J. Feng, H. Yang, and Q. He, “Auc-oriented graph neural network for fraud detection,” in Proceedings of the ACM Web Conference 2022, 2022, p. 1311–1321.
- Y. Dou, Z. Liu, L. Sun, Y. Deng, H. Peng, and P. S. Yu, “Enhancing graph neural network-based fraud detectors against camouflaged fraudsters,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management, 2020, p. 315–324.
- J. Tang, J. Li, Z. Gao, and J. Li, “Rethinking graph neural networks for anomaly detection,” in Proceedings of the 39th International Conference on Machine Learning, 2022, pp. 21 076–21 089.
- G. Zhang, J. Wu, J. Yang, A. Beheshti, S. Xue, C. Zhou, and Q. Z. Sheng, “Fraudre: Fraud detection dual-resistant to graph inconsistency and imbalance,” in Proceedings of the 2021 IEEE International Conference on Data Mining, 2021, pp. 867–876.
- B. Chen, J. Zhang, X. Zhang, Y. Dong, J. Song, P. Zhang, K. Xu, E. Kharlamov, and J. Tang, “Gccad: Graph contrastive learning for anomaly detection,” IEEE Transactions on Knowledge and Data Engineering, 2022.
- Z. Chai, S. You, Y. Yang, S. Pu, J. Xu, H. Cai, and W. Jiang, “Can abnormality be detected by graph neural networks?” in Proceedings of the 31st International Joint Conference on Artificial Intelligence, 2022, pp. 1945–1951.
- S. Brody, U. Alon, and E. Yahav, “How attentive are graph attention networks?” in Proceedings of the 10th International Conference on Learning Representations, 2022.
- P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph attention networks,” in Proceedings of the 6th International Conference on Learning Representations, 2018.
- D. Busbridge, D. Sherburn, P. Cavallo, and N. Y. Hammerla, “Relational graph attention networks,” arXiv preprint arXiv:1904.05811, 2019.
- J. Zhu, Y. Yan, L. Zhao, M. Heimann, L. Akoglu, and D. Koutra, “Beyond homophily in graph neural networks: Current limitations and effective designs,” in Proceedings of the 34th International Conference on Neural Information Processing Systems, 2020, pp. 7793–7804.
- S. Luan, C. Hua, Q. Lu, J. Zhu, M. Zhao, S. Zhang, X.-W. Chang, and D. Precup, “Revisiting heterophily for graph neural networks,” in Proceedings of the 36th International Conference on Neural Information Processing Systems, 2022, pp. 1362–1375.
- Y. Ma, X. Liu, N. Shah, and J. Tang, “Is homophily a necessity for graph neural networks?” in Proceedings of the 10th International Conference on Learning Representations, 2022.
- A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” in Proceedings of the 31st International Conference on Neural Information Processing Systems, 2017, pp. 6000–6010.
- K. Xu, C. Li, Y. Tian, T. Sonobe, K.-i. Kawarabayashi, and S. Jegelka, “Representation learning on graphs with jumping knowledge networks,” in Proceedings of the 35th International Conference on Machine Learning, 2018, pp. 5453–5462.
- J. J. McAuley and J. Leskovec, “From amateurs to connoisseurs: Modeling the evolution of user expertise through online reviews,” in Proceedings of the 22nd International Conference on World Wide Web, 2013, p. 897–908.
- S. Zhang, H. Yin, T. Chen, Q. V. N. Hung, Z. Huang, and L. Cui, “Gcn-based user representation learning for unifying robust recommendation and fraudster detection,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 2020, p. 689–698.
- W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” in Proceedings of the 31st International Conference on Neural Information Processing Systems, 2017, p. 1025–1035.
- Y. Liu, X. Ao, Z. Qin, J. Chi, J. Feng, H. Yang, and Q. He, “Pick and choose: A gnn-based imbalanced learning approach for fraud detection,” in Proceedings of the ACM Web Conference 2021, 2021, p. 3168–3177.
- C. Chung, J. Lee, and J. J. Whang, “Representation learning on hyper-relational and numeric knowledge graphs with transformers,” in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2023, pp. 310–322.
- C. Chung and J. J. Whang, “Learning representations of bi-level knowledge graphs for reasoning beyond link prediction,” in Proceedings of the 37th AAAI Conference on Artificial Intelligence, 2023, pp. 4208–4216.
- J. Lee, C. Chung, and J. J. Whang, “InGram: Inductive knowledge graph embedding via relation graphs,” in Proceedings of the 40th International Conference on Machine Learning, 2023, pp. 18 796–18 809.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
