ГРАФОВІ ТА ЧАСОВІ НЕИРОННІ МОДЕЛІ ДЛЯ ПРОАКТИВНОІ ІДЕНТИФІКАЦІІ ШАХРАИСЬКИХ ОБЛІКОВИХ ЗАПИСІВ У БЛОКЧЕИНІ ETHEREUM
Abstract
Topicality. Fraudulent activities on the Ethereum blockchain pose a substantial risk to decentralized finance and require capable models not only to respond to already detected abuses but also to identify suspicious accounts proactively before losses escalate. The subject of study is the application of graph and temporal neural models to the task of classifying Ethereum accounts as benign or fraudulent, considering the structural relationships between addresses and the temporal dynamics of transactions. The purpose of this article is to develop and experimentally evaluate a neural architecture based on a multilayer perceptron as a baseline component for the subsequent integration of graph and temporal mechanisms, and to analyze its performance on the open Ethereum Fraud Detection dataset, which features a high-class imbalance. The following results were obtained. A baseline deep model for binary account classification was constructed using feature preprocessing, stratified data splitting, class weight balancing, L2 regularization, Dropout, and early stopping, which enabled the achievement of an ROC AUC value of approximately 0.98 under conditions of a pronounced dominance of the safe class. A detailed analysis of the confusion matrix and the precision, recall, and F1 metrics demonstrated an acceptable trade-off between reducing false positives and minimizing the proportion of missed fraudulent accounts, which is critical for real-world financial scenarios. Conclusion. The results indicate that a properly designed baseline neural model on tabular features can ensure high-quality proactive identification of fraudulent Ethereum accounts and serve as a starting point for further integration of graph and temporal architectures aimed at improving interpretability and robustness to the evolution of malicious behavior patterns.
Community
0 commentsNo discussion yet
Be the first to share a question or observation.