| Literature DB >> 35310593 |
Abstract
Commercial banks are of great value to social and economic development. Therefore, how to accurately evaluate their credit risk and establish a credit risk prevention system has important theoretical and practical significance. This paper combines BP neural network with a mutation genetic algorithm, focuses on the credit risk assessment of commercial banks, applies neural network as the main modeling tool of the credit risk assessment of commercial banks, and uses the mutation genetic algorithm to optimize the main parameter combination of neural network, so as to give better play to the efficiency of neural network. After verification of various evaluation models, the accuracy of the evaluation model designed in this paper is more than 65%, while the acceptability of the evaluation results optimized by the mutation genetic algorithm is more than 85%. Compared with the accuracy of about 50% of the traditional credit scoring method, the accuracy of the credit risk evaluation using neural network technology is improved by more than 10%. It is proved that the performance of the optimized algorithm is better than that of the traditional neural network algorithm. It has important theoretical and practical significance for the establishment of the credit risk prevention system of commercial banks.Entities:
Mesh:
Year: 2022 PMID: 35310593 PMCID: PMC8930209 DOI: 10.1155/2022/2724842
Source DB: PubMed Journal: Comput Intell Neurosci
Relationship of output of evaluation model and credit rating.
| Credit rating | Output of training phase evaluation model |
|---|---|
|
| (0.9, 1.0] |
|
| (0.8, 0.9] |
|
| (0.7, 0.8] |
|
| (0.6, 0.7] |
|
| (0, 0.6] |
Figure 1The basic flow of the genetic algorithm.
Figure 2General framework of the credit risk assessment system.
Figure 3Structure diagram of application module of the credit risk assessment model.
Figure 4Classification and distribution of credit rating.
Figure 5Classification and distribution of credit rating in test samples.
Model training under a different number of hidden layer nodes.
| Mode code | Number of hidden layer nodes | Simulation convergence |
|---|---|---|
| 0101 | 5 | Within 2000 training times, the simulation does not converge |
| 10 | >1500 training, | |
| 15 | >1300 training, | |
| 20 | <1200 training | |
| 25 | <1100 training | |
| 0102 | 5 | Within 3500 training times, the simulation does not converge |
| 10 | Within 3500 training times, the simulation does not converge | |
| 15 | >1800 training | |
| 20 | <1800 training | |
| 25 | <1600 training |
Figure 6Training error function under different η and α. (a) Training times: 1178; (b) training times: 544.
Model training under different network initial weights.
| Mode code | Network weight sequence number | Simulation convergence | Number of classification errors |
|---|---|---|---|
| 0101 | Initialization 1 | Within 3500 training times, the simulation does not converge | 15 |
| Initialization 2 | Simulation convergence, training steps 1875 | 12 | |
| Initialization 3 | Simulation convergence, training steps 1168 | 10 | |
| 0102 | Initialization 4 | Simulation convergence, training steps 1050 | 11 |
| Initialization 5 | Simulation convergence, training steps 978 | 9 | |
| Initialization 6 | Within 3500 training times, the simulation does not converge | 11 | |
| 0103 | Initialization 7 | Within 3500 training times, the simulation does not converge | 14 |
| Initialization 8 | Simulation convergence, training steps 2238 | 10 | |
| Initialization 9 | Within 3500 training times, the simulation does not converge | 12 |
Figure 7Comparison of training accuracy between the two algorithms. (a) BP algorithm; (b) our algorithm.
Comparison of training efficiency between the two algorithms.
| BP algorithm | Our algorithm (s) | |
|---|---|---|
| Training time | 7.230 s | 4.836 |
Figure 8Simulation comparison of evaluation models under two algorithms.