Association-Focused Path Aggregation for Graph Fraud Detection

Tao Wang (Ministry of Emergency Management Big Data Center) · Yang Gao (Nanjing University) · Tian Qiu (Zhejiang University) · Wenda Li (Zhejiang University) · Zunlei Feng (Zhejiang University) · Jie Lei (Meta) · Yi Gao (Zhejiang University) · Mingli Song (Zhejiang University)
aggregation-enhanced detectionaverage precisionbenchmark datasetfraud detectiong-internet datasetgraph path aggregationhigh-order interactionsimplicit patternsinterpretabilityintricate dependenciesnoisy labelspath interactionsemantic-associated path encodingstructural associationsvariable-length path sampling

Fraudulent activities have caused substantial negative social impacts and are exhibiting emerging characteristics such as intelligence and industrialization, posing challenges of high-order interactions, intricate dependencies, and the sparse yet concealed nature of fraudulent entities. Existing graph fraud detectors are limited by their narrow "receptive fields", as they focus only on the relations between an entity and its neighbors while neglecting longer-range structural associations hidden between entities. To address this issue, we propose a novel fraud detector based on Graph Path Aggregation (GPA). It operates through variable-length path sampling, semantic-associated path encoding, path interaction and aggregation, and aggregation-enhanced fraud detection. To further facilitate interpretable association analysis, we synthesize G-Internet, the first benchmark dataset in the field of internet fraud detection. Extensive experiments across datasets in multiple fraud scenarios demonstrate that the proposed GPA outperforms mainstream fraud detectors by up to +15% in Average Precision (AP). Additionally, GPA exhibits enhanced robustness to noisy labels and provides excellent interpretability by uncovering implicit fraudulent patterns across broader contexts. Code is available at https://github.com/horrible-dong/GPA.