PREF-Gate通过验证门控选择证据,提升图欺诈检测的可信度与可审计性。
PREF-Gate: Provenance-Constrained Relational Evidence Fusion with Validation-Gated Selection for Graph Fraud Detection

- 设计双专家+验证门控框架,根据验证数据自动选择使用标签自由或标签依赖证据
- 在Amazon、YelpChi、TFinance上平均AUPRC达0.9085、0.8104、0.8913,表现优异
- 适合需要可解释、可审计决策的金融反欺诈场景
关系欺诈检测可利用无标签图上下文和基于标签的邻域证据,但两者有效性条件不同。当查询节点自身标签或任何验证/测试标签进入邻域构建时,邻域风险即失效。本文将此问题建模为溯源约束的关系证据使用,提出PREF-Gate——一个具有两个固定专家和有限验证门控的可审计决策框架。上下文专家使用属性、一跳均值、特征残差和度描述符,不依赖标签;证据专家则引入自排除的训练标签邻域风险及经验贝叶斯摘要,揭示支持度、不确定性、可用性和收缩性。测试前,门控从两个专家或三个预设概率混合中选择,并固定决策阈值。在Amazon、YelpChi和TFinance上,采用五次分层划分和14种相同协议方法,PREF-Gate平均AUPRC分别为0.9085、0.8104、0.8913。其在所有Amazon和YelpChi划分中选择标签自由专家,在所有TFinance划分中选择证据混合。因此,核心结论是条件性的:仅当验证集支持时,标签衍生证据才有效。该框架结合了竞争性排名性能与显式标签溯源契约、有限选择策略、失败归因和审查预算评估,为图欺诈检测提供可审计的知识驱动决策流程。
原文摘要 · Abstract (English)
Relational fraud detection can exploit both label-free graph context and label-derived neighborhood evidence, but these two information sources obey different validity conditions. In particular, neighborhood risk becomes invalid when a queried node's own label, or any validation or test label, enters its construction. We formulate this issue as provenance-constrained relational evidence use and present PREF-Gate, an auditable decision framework with two fixed experts and a finite validation gate. The context expert uses attributes, one-hop means, feature residuals, and degree descriptors without labels. The evidence expert adds self-excluded, training-label-only neighborhood risk and empirical-Bayes summaries that expose support, uncertainty, availability, and shrinkage. Before test inference, the gate selects either expert or one of three pre-specified probability mixtures and fixes the decision threshold. On Amazon, YelpChi, and TFinance, using five identical stratified splits and 14 same-protocol methods, PREF-Gate obtains mean AUPRC values of 0.9085, 0.8104, and 0.8913. It selects the label-free expert on all Amazon and YelpChi splits and an evidence mixture on all TFinance splits. Thus, the main result is conditional rather than universal: label-derived relational evidence is useful only where held-out validation supports it. The framework couples competitive ranking performance with an explicit label-provenance contract, finite selection policy, failure accounting, and review-budget evaluation, providing an auditable knowledge-based decision pipeline for graph fraud detection.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。