Effects of Scale Regularization in Fraud Detection Graphs

With the growth of e-commerce platforms, the number of fraud reviews has rapidly increased, making fraud detection for platform data critically important. To detect fraud reviews in platform data, recent approaches have leveraged graph neural networks that model users as nodes in a heterogeneous multi-relational graph structure. This approach represents platform users as nodes in a graph, and the relationships among users who share commonalities in their reviews or products as edges, in order to identify fraudulent reviewers. However, existing graph-based fraud detection methods may suffer from the unstable training of the classifier networks that process embedding vectors. In this paper, we identify that this issue arises from the excessive deviation and scale expansion caused by some of the aggregated values from adjacent nodes in conventional node embeddings, and we propose a scale regularization method to mitigate this. To verify the effectiveness of the proposed method, we conduct validation on the Amazon-Fraud dataset, which is a multi-relational graph dataset constructed from review data of Amazon E-Commerce. The experimental results show that the proposed scale regularization achieves superior performance compared to previous verified graph fraud detection models.