Application of Gradient Boosting Algorithms for Anti-money Laundering in Cryptocurrencies

作者: Joshua Ellul , Dylan Vassallo , Vincent Vella

DOI: 10.1007/S42979-021-00558-Z

关键词:

摘要: The recent emergence of cryptocurrencies has added another layer complexity in the fight towards financial crime. Cryptocurrencies require no central authority and offer pseudo-anonymity to its users, allowing criminals disguise themselves among legitimate users. On other hand, openness data fuels investigator’s toolkit conduct forensic examinations. This study focuses on detection illicit activities (e.g., scams, financing terrorism, Ponzi schemes) cryptocurrency infrastructures, both at an account transaction level. Previous work identified that class imbalance dynamic environment created by evolving techniques deployed avoid are widespread this domain. In our study, we propose Adaptive Stacked eXtreme Gradient Boosting (ASXGB), adaptation (XGBoost), better handle environments present a comparative analysis various offline decision tree-based ensembles heuristic-based data-sampling techniques. Our results show that: (i) gradient boosting algorithms outperform state-of-the-art Random Forest (RF) level, (ii) approach NCL-SMOTE further improves recall (iii) proposed ASXGB successfully reduced impact concept drift while improving

参考文章(53)
David H. Wolpert, Original Contribution: Stacked generalization Neural Networks. ,vol. 5, pp. 241- 259 ,(1992) , 10.1016/S0893-6080(05)80023-1
Jesse Read, Albert Bifet, Bernhard Pfahringer, Geoff Holmes, Batch-incremental versus instance-incremental learning in dynamic and evolving data intelligent data analysis. pp. 313- 323 ,(2012) , 10.1007/978-3-642-34156-4_29
Chumphol Bunkhumpornpat, Krung Sinapiromsaran, Chidchanok Lursinsap, Safe-Level-SMOTE: Safe-Level-Synthetic Minority Over-Sampling TEchnique for Handling the Class Imbalanced Problem Advances in Knowledge Discovery and Data Mining. pp. 475- 482 ,(2009) , 10.1007/978-3-642-01307-2_43
Jimmy Yicheng Huang, Effectiveness of US anti-money laundering regulations and HSBC case study Journal of Money Laundering Control. ,vol. 18, pp. 525- 532 ,(2015) , 10.1108/JMLC-05-2015-0018
P. Hart, The condensed nearest neighbor rule (Corresp.) IEEE Transactions on Information Theory. ,vol. 14, pp. 515- 516 ,(1968) , 10.1109/TIT.1968.1054155
Saso Džeroski, Bernard Ženko, Is Combining Classifiers with Stacking Better than Selecting the Best One Machine Learning. ,vol. 54, pp. 255- 273 ,(2004) , 10.1023/B:MACH.0000015881.36452.6E
Albert Bifet, Eibe Frank, Geoff Holmes, Bernhard Pfahringer, Ensembles of Restricted Hoeffding Trees ACM Transactions on Intelligent Systems and Technology. ,vol. 3, pp. 30- ,(2012) , 10.1145/2089094.2089106
James G. MacKinnon, Approximate Asymptotic Distribution Functions for Unit-Root and Cointegration Tests Journal of Business & Economic Statistics. ,vol. 12, pp. 167- 176 ,(1994) , 10.1080/07350015.1994.10510005
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Andreas Müller, Joel Nothman, Gilles Louppe, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, Jake Vanderplas, Alexandre Passos, David Cournapeau, Matthieu Brucher, Matthieu Perrot, Édouard Duchesnay, Scikit-learn: Machine Learning in Python Journal of Machine Learning Research. ,vol. 12, pp. 2825- 2830 ,(2011)
Yoshua Bengio, Rémi Bardenet, James S. Bergstra, Balázs Kégl, Algorithms for Hyper-Parameter Optimization neural information processing systems. ,vol. 24, pp. 2546- 2554 ,(2011)