English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 96218/96218 (100%)
造訪人次 : 93572032      線上人數 : 197
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋


    請使用永久網址來引用或連結此文件: https://ir.lib.ncu.edu.tw/handle/987654321/111151


    題名: 基於主動學習與持續學習之風險感知多尺度 Transformer 圖網路於穩健詐欺偵測;A Risk-Aware Multi-Scale Transformer Graph Network for Robust Fraud Detection via Active and Continual Learning
    作者: 阮裕善;THIEN, NGUYEN NGOC
    貢獻者: 資訊工程學系
    關鍵詞: 詐欺偵測;圖神經網路;圖注意力;多尺度 Transformer;主動學習;持續學習;災難性遺忘;類別不平衡;概念漂移;fraud detection;graph neural networks;multi-scale graph attention;active learning;continual learning;catastrophic forgetting;class imbalance;concept drift
    日期: 2026-08-22
    上傳時間: 2026-10-20 17:00:40 (UTC+8)
    出版者: 國立中央大學
    摘要: 金融詐欺偵測面臨三項核心挑戰:詐欺事件稀少、行為模式隨時間漂移,以及可信標註稀少且昂貴。本論文以風險感知門控時序圖注意力網路(RGTAN)為骨幹,沿三方向加以延伸。

    第一,提出唯一新穎架構元件「多尺度圖注意力頭(MS-GTGA)」,於三種鄰域解析度(全部邊、最強前 50% 與前 25% 邊)並行計算注意力,以可學習門控融合。第二,採分階段之主動學習至持續學習訓練框架,由主動訓練教師熱啟動學生,以彈性權重鞏固、知識蒸餾與經驗回放正則化,防止遺忘。第三,對各元件在何種條件下有效進行誠實的實證刻畫。

    於三個公開資料集(S-FFSD、YelpChi、Amazon)以三個隨機種子評估。多尺度方法在詐欺群聚、圖稀疏且標註部分缺失時效益最顯著:S-FFSD 測試 AUC 達 0.986,最差種子仍達 0.984,遠較單尺度骨幹(0.892 至 0.990)穩定;交叉驗證估計(約 0.81)較低,存在泛化落差,本文全程均一併報告。本研究不宣稱全面超越先前方法:YelpChi 上有高階方法表現更佳,Amazon 上單尺度即具競爭力。;Financial fraud detection poses three structural difficulties: fraud is rare, adversarial behaviour drifts over time, and trustworthy labels are scarce and costly. A practical detector must exploit the relational structure between transactions, learn from few labels, and adapt to drift without forgetting prior knowledge.

    This thesis extends the Risk-aware Gated Temporal Attention Network (RGTAN) along three axes. First, a multi-scale transformer graph-attention head (MS-GTGA) runs attention at three neighbourhood resolutions -- all edges, the top-50%, and the top-25% strongest -- and fuses them with a learnable gate. Second, the model is trained in a staged Active-Learning to Continual-Learning framework: an actively-trained teacher warm-starts a student regularized by Elastic Weight Consolidation, Knowledge Distillation, and Experience Replay. Third, the conditions under which each component helps are characterised empirically.

    Evaluation on three public benchmarks (S-FFSD, YelpChi, Amazon) with 3-seed mean plus or minus standard deviation shows the multi-scale model is strongest where fraud is clustered and the graph is sparse. On S-FFSD the combined model achieves test AUC 0.986 plus or minus 0.002 and never falls below 0.984 across seeds; the single-scale baseline ranges from 0.892 to 0.990, so the advantage is largest in the worst case. A measured concentration of fraud-fraud edges in the pruned sub-graph provides mechanistic evidence that pruning learns to denoise; a same-parameter [1,1,1] control narrows the accuracy claim to the architecture rather than pruning alone. Continual learning reduces forgetting under a chronological split; under i.i.d. cross-validation forgetting is near-zero and serves as a sanity check only. A cross-validation estimate (oof_ap approximately 0.81) versus final test AP (0.986) generalization gap is reported throughout.

    The contributions are (1) the MS-GTGA multi-scale gated-fusion head, (2) the staged AL-to-CL training framework, and (3) an empirical characterisation of when multi-scale aggregation helps. The backbone is inherited from RGTAN; a high-order method exceeds ours on YelpChi and single-scale RGTAN is competitive on Amazon.
    顯示於類別:[資訊工程研究所] 博碩士論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbHTML7檢視/開啟


    在NCUIR中所有的資料項目都受到原著作權保護.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明