EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

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

Seok-Jun Buu, Hae-Jung Kim

Mathematics · 27.10.2026 · 14 (21) · 3924

DOI: 10.3390/math14213924 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 27.10.2026. Verfasst von Seok-Jun Buu und 1 weiteren Autor:innen. Die Arbeit nennt 27 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Ministry of SMEs and Startups.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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.

Förderung

  • Ministry of SMEs and Startups

Zitieren

APA

Buu, S., & Kim, H. (2026). Context-Guided Traversal with Deep Reinforcement Learning for Suspicious Subgraph Detection in Cryptocurrency Transaction Graphs. Mathematics, 14(21), 3924. https://doi.org/10.3390/math14213924

Vancouver

Buu S, Kim H. Context-Guided Traversal with Deep Reinforcement Learning for Suspicious Subgraph Detection in Cryptocurrency Transaction Graphs. Mathematics. 2026;14(21):3924. doi:10.3390/math14213924

BibTeX
@article{Buu2026,
  author = {Buu, Seok-Jun and Kim, Hae-Jung},
  title = {Context-Guided Traversal with Deep Reinforcement Learning for Suspicious Subgraph Detection in Cryptocurrency Transaction Graphs},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {21},
  pages = {3924},
  doi = {10.3390/math14213924}
}
Kostenlos starten →