通过时空一致性约束,提升动态交易网络中欺诈检测的稳定性与召回率。
A Multi-Scale Graph Learning Framework with Temporal Consistency Constraints for Financial Fraud Detection in Transaction Networks under Non-Stationary Conditions
- 采用多尺度图传播与时空注意力机制,捕捉交易网络的复杂关系。
- 在PaySim数据集上实现高不平衡条件下的强召回率,优于多数图学习方法。
- 适合关注金融欺诈检测中结构依赖性与模型稳定性的研究者。
在非平稳条件下,交易网络中的金融欺诈检测需应对稀疏异常、动态模式及严重类别不平衡问题。真实场景中,可疑交易常通过账户、中介或时间序列相互关联,仅依赖属性或随机划分的模型难以发现结构性欺诈。本文提出STC-MixHop框架,结合空间多分辨率传播与轻量级时序一致性建模,包含三部分:受MixHop启发的多尺度邻域扩散编码器用于学习结构模式;时空注意力模块融合当前与历史图快照以稳定表征;基于未标注交易交互的时序自监督预训练策略,提升表示质量。主要在PaySim数据集上按严格时间划分评估,辅以Porto Seguro和FEMA数据测试跨域表现。结果表明,该框架在图学习方法中具有竞争力,在高度不平衡条件下实现强筛查召回。实验还揭示关键边界条件:当节点属性高度信息丰富时,表格基线仍难被超越;而图结构在隐藏关系依赖关键时贡献更显著。这些发现支持了金融欺诈检测中以稳定性为核心的图学习视角。
原文摘要 · Abstract (English)
Financial fraud detection in transaction networks involves modeling sparse anomalies, dynamic patterns, and severe class imbalance in the presence of temporal drift in the data. In real-world transaction systems, a suspicious transaction is rarely isolated: rather, legitimate and suspicious transactions are often connected through accounts, intermediaries or through temporal transaction sequences. Attribute-based or randomly partitioned learning pipelines are therefore insufficient to detect relationally structured fraud. STC-MixHop, a graph-based framework combining spatial multi-resolution propagation with lightweight temporal consistency modeling for anomaly and fraud detection in dynamic transaction networks. It integrates three components: a MixHop-inspired multi-scale neighborhood diffusion encoder a multi-scale neighborhood diffusion MixHop-based encoder for learning structural patterns; a spatial-temporal attention module coupling current and preceding graph snapshots to stabilize representations; and a temporally informed self-supervised pretraining strategy exploiting unlabeled transaction interactions to improve representation quality. We evaluate the framework primarily on the PaySim dataset under strict chronological splits, supplementing the analysis with Porto Seguro and FEMA data to probe cross-domain component behavior. Results show that STC-MixHop is competitive among graph methods and achieves strong screening-oriented recall under highly imbalanced conditions. The experiments also reveal an important boundary condition: when node attributes are highly informative, tabular baselines remain difficult to outperform. Graph structure contributes most clearly where hidden relational dependencies are operationally important. These findings support a stability-focused view of graph learning for financial fraud detection.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。