Pith. sign in

REVIEW 1 cited by

Temporal Graph Networks for Graph Anomaly Detection in Financial Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.00060 v1 pith:VGRP6ZZV submitted 2024-03-27 q-fin.ST cs.AIcs.LG

classification q-fin.STcs.AIcs.LG
keywords financialgraphdetectionnetworksanomalyperformancebaselinesdynamic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper explores the utilization of Temporal Graph Networks (TGN) for financial anomaly detection, a pressing need in the era of fintech and digitized financial transactions. We present a comprehensive framework that leverages TGN, capable of capturing dynamic changes in edges within financial networks, for fraud detection. Our study compares TGN's performance against static Graph Neural Network (GNN) baselines, as well as cutting-edge hypergraph neural network baselines using DGraph dataset for a realistic financial context. Our results demonstrate that TGN significantly outperforms other models in terms of AUC metrics. This superior performance underlines TGN's potential as an effective tool for detecting financial fraud, showcasing its ability to adapt to the dynamic and complex nature of modern financial systems. We also experimented with various graph embedding modules within the TGN framework and compared the effectiveness of each module. In conclusion, we demonstrated that, even with variations within TGN, it is possible to achieve good performance in the anomaly detection task.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Towards the Explainability of Temporal Graph Networks via Memory Backtracking and Topological Attribution

    cs.LG 2026-07 conditional novelty 6.5 of 10

    MemExplainer attributes TGN logits to neighboring and historical events via LRP on topology and memory trees, then optimizes event selection for fidelity, outperforming baselines on nine datasets.

Pith tools