Context-Guided Traversal with Deep Reinforcement Learning for Suspicious Subgraph Detection in Cryptocurrency Transaction Graphs

Detecting suspicious activity in cryptocurrency transaction networks is important for identifying illicit financial flows. When funds pass through several participants, the relationships among their transactions can reveal patterns that individual account attributes alone do not explain. Subgraph classification provides a way to evaluate these connected transactions as a group, using participant composition and local transaction paths. However, aggregating participant attributes does not preserve connection order, whereas observing only a few paths can overlook relevant information elsewhere in the group. Moreover, subgraph labels do not specify which paths are useful for detection. In this paper, we propose context-guided traversal with deep reinforcement learning to select informative paths according to the transaction group being examined. A role-wise context representation captures the composition of the group and its funding and receiving participants, enabling path selection to reflect the surrounding transaction relationships. This context is combined with the accumulated path representation to assess neighboring candidates and adapt subsequent observations. The traversal policy learns from subgraph classification performance without requiring annotated paths. Predictions from the selected paths are then combined with global transaction information to incorporate evidence beyond the visited nodes. In ten-fold cross-validation on the Elliptic2 Bitcoin dataset, the proposed method achieves average precision of 0.9657 and an F1 score of 0.9191, exceeding the corresponding mean scores of all nine evaluated comparison methods. A separate entity-disjoint test gives the highest three-seed mean AP of 0.6734 among four complete detectors. Transaction case analyses further show how the combined detector corrects missed suspicious subgraphs and false alarms from classification based on global information alone.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-10-27
DOI
https://doi.org/10.3390/math14213924
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Context-Guided Traversal with Deep Reinforcement Learning for Suspicious Subgraph Detection in Cryptocurrency Transaction Graphs

Seok-Jun Buu, Hae-Jung Kim
3 links
Mathematics
Advanced Graph Neural Networks
article

Context-Guided Traversal with Deep Reinforcement Learning for Suspicious Subgraph Detection in Cryptocurrency Transaction Graphs

Seok-Jun Buu, Hae-Jung Kim
article en

Abstract

Detecting suspicious activity in cryptocurrency transaction networks is important for identifying illicit financial flows. When funds pass through several participants, the relationships among their transactions can reveal patterns that individual account attributes alone do not explain. Subgraph classification provides a way to evaluate these connected transactions as a group, using participant composition and local transaction paths. However, aggregating participant attributes does not preserve connection order, whereas observing only a few paths can overlook relevant information elsewhere in the group. Moreover, subgraph labels do not specify which paths are useful for detection. In this paper, we propose context-guided traversal with deep reinforcement learning to select informative paths according to the transaction group being examined. A role-wise context representation captures the composition of the group and its funding and receiving participants, enabling path selection to reflect the surrounding transaction relationships. This context is combined with the accumulated path representation to assess neighboring candidates and adapt subsequent observations. The traversal policy learns from subgraph classification performance without requiring annotated paths. Predictions from the selected paths are then combined with global transaction information to incorporate evidence beyond the visited nodes. In ten-fold cross-validation on the Elliptic2 Bitcoin dataset, the proposed method achieves average precision of 0.9657 and an F1 score of 0.9191, exceeding the corresponding mean scores of all nine evaluated comparison methods. A separate entity-disjoint test gives the highest three-seed mean AP of 0.6734 among four complete detectors. Transaction case analyses further show how the combined detector corrects missed suspicious subgraphs and false alarms from classification based on global information alone.

MathematicsVol. 14(21)
Gyeongsang National University (KR), Kyungil University (KR)
Ministry of SMEs and Startups
Openalex Percentile: Top 13%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon