Robust recurrent graph convolutional network approach based sequential prediction of illicit transactions in cryptocurrencies

Authors: Alarab, I. and Prakoonwit, S.

Journal: Multimedia Tools and Applications

Volume: 83

Issue: 20

Pages: 58449-58464

eISSN: 1573-7721

ISSN: 1380-7501

DOI: 10.1007/s11042-023-17323-4

Abstract:

Money laundering has urged the need for machine learning algorithms for combating illicit services in the blockchain of cryptocurrencies due to its increasing complexity. Recent studies have revealed promising results using supervised learning methods in classifying illicit Bitcoin transactions of Elliptic data, one of the largest labelled data of Bitcoin transaction graphs. Nonetheless, all learning algorithms have failed to capture the dark market shutdown event that occurred in this data using its original features. This paper proposes a novel method named recurrent graph neural network model that extracts the temporal and graph topology of Bitcoin data to perform node classification as licit/illicit transactions. The proposed model performs sequential predictions that rely on recent labelled transactions designated by antecedent neighbouring features. Our main finding is that the proposed model against various models on Elliptic data has achieved state-of-the-art with accuracy and f1-score of 98.99% and 91.75%, respectively. Moreover, we visualise a snapshot of a Bitcoin transaction graph of Elliptic data to perform a case study using a backward reasoning process. The latter highlights the effectiveness of the proposed model from the explainability perspective. Sequential prediction leverages the dynamicity of the graph network in Elliptic data.

https://eprints.bournemouth.ac.uk/39075/

Source: Scopus

Robust recurrent graph convolutional network approach based sequential prediction of illicit transactions in cryptocurrencies

Authors: Alarab, I. and Prakoonwit, S.

Journal: MULTIMEDIA TOOLS AND APPLICATIONS

eISSN: 1573-7721

ISSN: 1380-7501

DOI: 10.1007/s11042-023-17323-4

https://eprints.bournemouth.ac.uk/39075/

Source: Web of Science (Lite)

Robust Recurrent Graph Convolutional Network Approach based Sequential Prediction of Illicit Transactions in Cryptocurrencies

Authors: Alarab, I. and Prakoonwit, S.

Journal: Multimedia Tools and Applications

DOI: 10.1007/s11042-023-17323-4

https://eprints.bournemouth.ac.uk/39075/

Source: Manual

Robust Recurrent Graph Convolutional Network Approach based Sequential Prediction of Illicit Transactions in Cryptocurrencies

Authors: Alarab, I. and Prakoonwit, S.

Journal: Multimedia Tools and Applications

Volume: 83

Pages: 58449-58464

ISSN: 1380-7501

Abstract:

Money laundering has urged the need for machine learning algorithms for combating illicit services in the blockchain of cryptocurrencies due to its increasing complexity. Recent studies have revealed promising results using supervised learning methods in classifying illicit Bitcoin transactions of Elliptic data, one of the largest labelled data of Bitcoin transaction graphs. Nonetheless, all learning algorithms have failed to capture the dark market shutdown event that occurred in this data using its original features. This paper proposes a novel method named recurrent graph neural network model that extracts the temporal and graph topology of Bitcoin data to perform node classification as licit/illicit transactions. The proposed model performs sequential predictions that rely on recent labelled transactions designated by antecedent neighbouring features. Our main finding is that the proposed model against various models on Elliptic data has achieved state-of-the-art with accuracy and f1-score of 98.99% and 91.75%, respectively. Moreover, we visualise a snapshot of a Bitcoin transaction graph of Elliptic data to perform a case study using a backward reasoning process. The latter highlights the effectiveness of the proposed model from the explainability perspective. Sequential prediction leverages the dynamicity of the graph network in Elliptic data.

https://eprints.bournemouth.ac.uk/39075/

Source: BURO EPrints