Перейти к основному содержанию
AkademIndex

Продукты

Для разработчиков

AkademBaseОткрытый API экосистемы
Статья

An improved gradient boosting tree algorithm for financial risk management

Srijana AcharyaDepartment of Convergence Science, Kongju National University, Gongju, 32588, KoreaIrina V. PustokhinaDepartment of Entrepreneurship and Logistics, Plekhanov Russian University of Economics, Moscow, 117997, RussiaDenis A. PustokhinDepartment of Logistics, State University of Management, Moscow, 109542, RussiaB. T. GeethaDepartment of Electronics and Communication Engineering, Saveetha Institute of Medical And Technical Sciences, Tamil Nadu, 600077, IndiaGyanendra Prasad JoshiDepartment of Computer Science and Engineering, Sejong University, Seoul, 05006, KoreaJamel NebhenCollege of Computer Engineering and Sciences, Prince Sattam bin Abdulaziz University, Alkharj, 11942, Saudi ArabiaEunmok YangDepartment of Financial Information Security, Kookmin University, Seoul, 02707, KoreaChangho SeoDepartment of Convergence Science, Kongju National University, Gongju, 32588, Korea
2021en
ABI

Аннотация

Financial risk assessment (FRA) is an essential process in financial institutions determining a company’s creditworthiness. This paper introduces a new wrapper feature selection with a clustering-based FRA model to assess the financial status. This study involves three different phases of operations such as feature selection, clustering, and classification. The proposed model initially designs an Information Gain Directed Feature Selection algorithm that offers to rank to the features utilising the information gain. In addition, the proposed model also involves an improved K-means clustering technique to cluster the data. Finally, the gradient boosting tree classifier model is executed to perform the classification process. The proposed model tested using two benchmark datasets. The simulation results indicate that the projected FRA model obtains maximum accuracy values of 95.68% and 94.76% on the applied datasets.

Перевод пока недоступен

Идентификаторы

Цитирования и источники

Цитирований: 2Использованных источников: 0