REVIEW 2 cited by
Temporal Motifs for Financial Networks: A Study on Mercari, JPMC, and Venmo Platforms
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
read the original abstract
Understanding the dynamics of financial transactions among people is critical for various applications such as fraud detection. One important aspect of financial transaction networks is temporality. The order and repetition of transactions can offer new insights when considered within the graph structure. Temporal motifs, defined as a set of nodes that interact with each other in a short time period, are a promising tool in this context. In this work, we study three unique temporal financial networks: transactions in Mercari, an online marketplace, payments in a synthetic network generated by J.P. Morgan Chase, and payments and friendships among Venmo users. We consider the fraud detection problem on the Mercari and J.P. Morgan Chase networks, for which the ground truth is available. We show that temporal motifs offer superior performance to several baselines, including a previous method that considers simple graph features and two node embedding techniques (LINE and node2vec), while being practical in terms of runtime performance. For the Venmo network, we investigate the interplay between financial and social relations on three tasks: friendship prediction, vendor identification, and analysis of temporal cycles. For friendship prediction, temporal motifs yield better results than general heuristics, such as Jaccard and Adamic-Adar measures. We are also able to identify vendors with high accuracy and observe interesting patterns in rare motifs, such as temporal cycles. We believe that the analysis, datasets, and lessons from this work will be beneficial for future research on financial transaction networks.
Forward citations
Cited by 2 Pith papers
-
Triadic First-Order Logic Queries in Temporal Networks
FOLTY is the first algorithm for thresholded FOL triadic motif queries on temporal networks, with O(m α log σ_max) running time matching the best temporal triangle counters.
-
ATM-GAD: Adaptive Temporal Motif Graph Anomaly Detection for Financial Transaction Networks
ATM-GAD detects fraudulent accounts by combining per-account adaptive time windows, temporal three-node motifs, and two attention layers, reporting state-of-the-art AUPRC across four financial datasets.
Discussion (0). Continue with ORCID to comment.