Detecting Anomalies in Blockchain Transactions using Machine Learning Classifiers and Explainability Analysis

• URL: http://arxiv.org/abs/2401.03530v1
• Date: Sun, 7 Jan 2024 16:01:51 GMT
• Title: Detecting Anomalies in Blockchain Transactions using Machine Learning Classifiers and Explainability Analysis
• Authors: Mohammad Hasan, Mohammad Shahriar Rahman, Helge Janicke, Iqbal H. Sarker
• Abstract summary: This study integrates XAI techniques and anomaly rules into tree-based ensemble classifiers for detecting anomalous Bitcoin transactions. We introduce an under-sampling algorithm named XGBCLUS, designed to balance anomalous and non-anomalous transaction data. Our proposed ensemble classifiers outperform traditional single tree-based machine learning classifiers in terms of accuracy, TPR, and FPR scores.
• Score: 4.456941846147711
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As the use of Blockchain for digital payments continues to rise in popularity, it also becomes susceptible to various malicious attacks. Successfully detecting anomalies within Blockchain transactions is essential for bolstering trust in digital payments. However, the task of anomaly detection in Blockchain transaction data is challenging due to the infrequent occurrence of illicit transactions. Although several studies have been conducted in the field, a limitation persists: the lack of explanations for the model's predictions. This study seeks to overcome this limitation by integrating eXplainable Artificial Intelligence (XAI) techniques and anomaly rules into tree-based ensemble classifiers for detecting anomalous Bitcoin transactions. The Shapley Additive exPlanation (SHAP) method is employed to measure the contribution of each feature, and it is compatible with ensemble models. Moreover, we present rules for interpreting whether a Bitcoin transaction is anomalous or not. Additionally, we have introduced an under-sampling algorithm named XGBCLUS, designed to balance anomalous and non-anomalous transaction data. This algorithm is compared against other commonly used under-sampling and over-sampling techniques. Finally, the outcomes of various tree-based single classifiers are compared with those of stacking and voting ensemble classifiers. Our experimental results demonstrate that: (i) XGBCLUS enhances TPR and ROC-AUC scores compared to state-of-the-art under-sampling and over-sampling techniques, and (ii) our proposed ensemble classifiers outperform traditional single tree-based machine learning classifiers in terms of accuracy, TPR, and FPR scores.

Related papers

• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Blockchain Large Language Models [65.7726590159576]
  This paper presents a dynamic, real-time approach to detecting anomalous blockchain transactions. The proposed tool, BlockGPT, generates tracing representations of blockchain activity and trains from scratch a large language model to act as a real-time Intrusion Detection System.
  arXiv  Detail & Related papers  (2023-04-25T11:56:18Z)
• Towards Improved Illicit Node Detection with Positive-Unlabelled Learning [5.879542875341689]
  We discuss the label mechanism assumption for the hidden positive labels and its effect on the evaluation metrics. We show that PU classifiers dealing with potential hidden positive labels can have improved performance compared to regular machine learning models.
  arXiv  Detail & Related papers  (2023-03-04T17:36:09Z)
• Blockchain Framework for Artificial Intelligence Computation [1.8148198154149393]
  We design the block verification and consensus mechanism as a deep reinforcement-learning process. Our method is used to design the next generation of public blockchain networks.
  arXiv  Detail & Related papers  (2022-02-23T01:44:27Z)
• Optimal Clustering with Bandit Feedback [57.672609011609886]
  This paper considers the problem of online clustering with bandit feedback. It includes a novel stopping rule for sequential testing that circumvents the need to solve any NP-hard weighted clustering problem as its subroutines. We show through extensive simulations on synthetic and real-world datasets that BOC's performance matches the lower boundally, and significantly outperforms a non-adaptive baseline algorithm.
  arXiv  Detail & Related papers  (2022-02-09T06:05:05Z)
• Improving Face Recognition by Clustering Unlabeled Faces in the Wild [77.48677160252198]
  We propose a novel identity separation method based on extreme value theory. It greatly reduces the problems caused by overlapping-identity label noise. Experiments on both controlled and real settings demonstrate our method's consistent improvements.
  arXiv  Detail & Related papers  (2020-07-14T12:26:50Z)
• Detecting Malicious Accounts in Permissionless Blockchains using Temporal Graph Properties [4.506782035297339]
  temporal nature of modeling accounts as nodes and transactions as directed edges in a directed graph -- for a blockchain. Motivated by this, we introduce temporal features such as burst and attractiveness on top of several already used graph properties. We train various Machine Learning (ML) algorithms to identify the algorithm that performs the best in detecting which accounts are malicious.
  arXiv  Detail & Related papers  (2020-07-10T05:15:26Z)
• Certified Robustness to Label-Flipping Attacks via Randomized Smoothing [105.91827623768724]
  Machine learning algorithms are susceptible to data poisoning attacks. We present a unifying view of randomized smoothing over arbitrary functions. We propose a new strategy for building classifiers that are pointwise-certifiably robust to general data poisoning attacks.
  arXiv  Detail & Related papers  (2020-02-07T21:28:30Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.