Comparison of Several Data Mining Methods in Credit Card Default Prediction ()

Shenghui Yang^{}, Haomin Zhang^{*}

School of Science, Guilin University of Technology, Guilin, China.

**DOI: **10.4236/iim.2018.105010
PDF
HTML XML
2,910
Downloads
8,415
Views
Citations

School of Science, Guilin University of Technology, Guilin, China.

LightGBM is an open-source, distributed and high-performance GB framework built by Microsoft company. LightGBM has some advantages such as fast learning speed, high parallelism efficiency and high-volume data, and so on. Based on the open data set of credit card in Taiwan, five data mining methods, Logistic regression, SVM, neural network, Xgboost and LightGBM, are compared in this paper. The results show that the AUC, F_{1}-Score and the predictive correct ratio of LightGBM are the best, and that of Xgboost is second. It indicates that LightGBM or Xgboost has a good performance in the prediction of categorical response variables and has a good application value in the big data era.

Keywords

Share and Cite:

Yang, S. and Zhang, H. (2018) Comparison of Several Data Mining Methods in Credit Card Default Prediction. *Intelligent Information Management*, **10**, 115-122. doi: 10.4236/iim.2018.105010.

1. Introduction

As an unsecured credit facility, credit cards have huge risks behind the high returns of banks. The ever-increasing number of credit card circulation cards has brought about an increase in the amount of credit card defaults, and the resulting large amount of bills and repayment information data have also brought certain difficulties to the risk controllers. Therefore, how to use the data generated by users, and extract useful information to control risks, reduce default rate, and control the growth of non-performing rate has become one of the key concerns of banks.

Credit card default prediction is based on the historical data of credit card customers. The use of corresponding methods to predict and analyze credit card customer default behavior is a typical classification problem. Data mining algorithms have long been applied to the study of credit card default prediction problems. Thomas [1] used discriminant analysis to score the credits and behaviors of borrowers; Yeh and Lien [2] used Logistic regression, decision trees, artificial neural networks and other algorithms to predict customer default payments in Taiwan, and compared the predictions of these algorithms. Accuracy, finally found that the correct rate of artificial neural network is slightly higher than the other five methods. Mei Ruiting, Xu Yang and Wang Guochang [3] explored the key factors affecting customer credit by establishing Lasso-Logistic and random forest models. The results show that the accuracy of random forest prediction is higher than that of Lasso-Logistic.

2. Description of the Data

Feature Description

This article is based on credit card customer data from April to September 2005 in Taiwan on the UCI website. The data set contains 1 response variable (Default), 23 explanatory variables (X1 - X23), and 30,000 case data. The meaning of each variable in the data set is shown in Table 1. The frequency statistics of each category variable are shown in Table 1.

3. Introduction of the Method

3.1. Logistic Regression

Logistic regression is a special linear regression model. However, the two-category response variable violates the normal hypothesis of the general regression model.

Table 1. Default dataset of credit card.

The Logistic Regression Model specifies that the appropriate function of the event fit probability is a linear function of the observed values of the available explanatory variables. The main advantage of this approach is a simple classification probability formula can be generated. The insufficiency of Logistic regression is that the nonlinear and interactive effects of explanatory variables cannot be handled correctly.

3.2. Neural Network

Artificial neural networks use nonlinear mathematical equations to continuously establish meaningful relationships between input and output variables through the learning process. We apply backpropagation networks to classify data. Backpropagation neural networks use feedforward topology and supervised learning. The structure of a backpropagation network typically consists of an input layer, one or more hidden layers, and an output layer, each layer consisting of several neurons. Artificial neural networks can easily handle the nonlinearities and interactions of explanatory variables. The main disadvantage of artificial neural networks is that they do not give the result of a simple classification probability formula.

3.3. Support Vector Machine (SVM)

SVM is a pattern recognition method based on statistical learning theory. Which used the kernel function to map the data X of the input space into a high-dimensional feature space, and then at high In the dimensional space, the generalized optimal classification surface is obtained, and then the data that is linearly inseparable in the original space can be linearly classified in the high-dimensional space. The main difficulty of SVM is that after the kernel function is determined, when solving the problem classification, the quadratic programming of the solution function is required, which requires a large amount of storage space.

3.4. Xgboost

Boosting is a very effective integrated learning algorithm [4] . Boosting method can transform weak classification into strong classifier to achieve accurate classification effect. The steps are as follows:

1) All the training set samples are given the same weight;

2) The mth iteration is performed, and each iterations is classified by a classification algorithm, and the error rate

$er{r}_{m}=\frac{{\displaystyle \sum {\omega}_{i}I\left({y}_{i}\ne {G}_{m}{x}_{i}\right)}}{{\displaystyle \sum {\omega}_{i}}}$

of the classification is calculated, wherein ${\omega}_{i}$ represents the weight of the ith sample, $I(\cdot )$ is an indicative function, and ${G}_{m}$ represents the mth classifier;

3) Calculation ${a}_{m}=\mathrm{log}\left(\left(1-er{r}_{m}\right)/er{r}_{m}\right)$ ;

4) for $m+1$ iteration, update the weight ( ${\omega}_{i}$ ) of the i sample:

${\omega}_{i}\times {e}^{{a}_{m}\times I\left({y}_{i}\ne {G}_{m}{x}_{i}\right)}$ (1)

5) After completing the iteration, all the classifiers are obtained, and the classification result of each sample is obtained by voting. At its core, after each iterations, the sample with the wrong classification will be given a higher weight, thus improving the effect of the next classification.

Gradient Boosting (GB) is a kind of Boosting algorithm. It is proved that Boosting’s loss function is exponential, while GB is to make the loss function of the algorithm fall along its gradient direction during the iteration process, thus improving the robustness. The algorithm steps are:

1) ${f}_{0}\left(x\right)=\mathrm{arg}{\mathrm{min}}_{p}{\displaystyle \underset{i=1}{\overset{N}{\sum}}L\left({y}_{i},\gamma \right)}$

2) For $1-m$ iterations:

a) ${F}_{0}\left(x\right)=\mathrm{arg}{\mathrm{min}}_{p}{\displaystyle \underset{i=1}{\overset{N}{\sum}}L\left({y}_{i},\rho \right)}$

b) m from 1 to $M$ :

${\stackrel{\u02dc}{y}}_{i}=-{\left[\frac{\partial L\left({y}_{i},F\left({x}_{i}\right)\right)}{\partial F\left({x}_{i}\right)}\right]}_{F\left(x\right)={F}_{m-1}\left(x\right)},i=1,\mathrm{...},N$ (2)

${a}_{m}=\mathrm{arg}{\mathrm{min}}_{\alpha ,\beta}{\displaystyle \underset{i=1}{\overset{N}{\sum}}{\left[{\stackrel{\u02dc}{y}}_{i}-\beta h\left({X}_{i}:{a}_{m}\right)\right]}^{2}}$ (3)

${\rho}_{m}=\mathrm{arg}{\mathrm{min}}_{\rho}{\displaystyle \underset{i=1}{\overset{N}{\sum}}L\left({y}_{i},{F}_{m-1}\left({X}_{i}\right)+\rho h\left({X}_{i}:{a}_{m}\right)\right)}$ (4)

${F}_{m}\left(X\right)=F{}_{m-1}\left(X\right)+{\rho}_{m}h\left({X}_{i}:{a}_{m}\right)$ (5)

Xgboost is a fast implementation of the GB algorithm. It is a lifting algorithm based on decision tree. It takes both the linear model solver and the decision tree algorithm. The basic idea is to combine many decision tree models to form a model with high accuracy.

3.5. LightGBM

LightGBM is a gradient learning framework based on tree learning. The main difference between it and the Xgboost algorithm is that it uses a histogram-based algorithm to speed up the training process, reduce memory consumption, and adopt a leaf-wise leaf growth strategy with depth limitation [5] . The following describes the histogram algorithm and the leaf growth strategy with depth-limiting Leaf-wise.

3.5.1. Histogram Algorithm

The basic idea of the histogram algorithm is to discretize successive floating-point eigenvalues into k integers and construct a histogram of width k. When traversing the data, the statistic is accumulated in the histogram according to the discretized value as an index. After traversing the data once, the histogram accumulates the required statistic, and then traverses to find the optimal according to the discrete value of the histogram Split point. The process is shown in Figure 1.

3.5.2. Leaf-Wise Leaf Growth Strategy with Depth Limitation

The decision tree’s growth strategy is generally Level-wise, which is an inefficient algorithm because it treats the leaves of the same layer indiscriminately, resulting in a lot of unnecessary memory consumption. Leaf-wise is a more efficient strategy. Every time from all the leaves, find the leaf with the highest split gain, then split and cycle. Therefore, compared with Level-wise, Leaf-wise can reduce more errors and get better precision when the number of splits is the same. The disadvantage of Leaf-wise is that it may grow a deeper decision tree and produce over-fitting. Therefore, LightGBM adds a maximum depth limit above Leaf-wise to prevent over-fitting while ensuring high efficiency. The leaf-wise leaf growth process is shown in Figure 2.

4. Evaluation Criteria

4.1. Model Test

K-fold cross-validation is a commonly used accuracy test method in machine learning. Its purpose is to obtain a reliable and stable model. In the general problem, when the response variable is a quantitative variable, the cross-validation uses the mean square error as an indicator to measure the test error. On the classification problem, when the response variable is a qualitative variable, cross-validation uses the CV error rate as a measure. The form of the K-fold CV error rate as follows:

${\text{CV}}_{err}=\frac{1}{K}{\displaystyle \underset{i=1}{\overset{K}{\sum}}er{r}_{i}}$

Figure 1. Ergodicity process of histogram algorithm.

Figure 2. Leaf-wise tree growth.

4.2. Classification Evaluation

Under normal circumstances, for the two classification labels 0 and 1, there are definitions as follows:

The expression of the Acc is defined as follow:

$\text{Acc}=\frac{\left(\text{TP}+\text{TN}\right)}{\left(\text{TP}+\text{TN}+\text{FP}+\text{FN}\right)}\text{}$ (6)

Accuracy (Prec) and recall (Rec) are used to represent the general characteristics of the classifier. Accuracy is the percentage of cases that are marked as positive and indeed are indeed positive. The recall rate, also known as the true positive rate, is the percentage of cases that should have been correctly identified as positive. According to Table 2, the accuracy and recall rate are expressed as follows:

$\text{Prec}=\frac{\text{TP}}{\left(\text{TP}+\text{FP}\right)}\text{}$ (7)

$\text{Rec}=\frac{\text{TP}}{\left(\text{TP}+\text{FN}\right)}$ (8)

In general, Prec is high, Rec is low, Rec is high, and Prec is low. We need to balance the two and use ${\text{F}}_{\beta}\text{-score}$ [6] to reconcile the two. Expressed as follows:

${\text{F}}_{\beta}\text{-score}=\frac{\left(1+{\beta}^{2}\right)\text{Prec}\ast \text{Rec}}{{\beta}^{2}\text{Prec}+\text{Rec}}\text{}$ (9)

In the case, Generally, when we think accuracy is more important, we set $\beta =0.5$ ; if we think recall is more important, we set $\beta =2$ . While $\beta =1$ , we will get the harmonic mean value of the sum, which is recorded as the result of the sum, and the expression is as follows:

${\text{F}}_{\text{1}}\text{=}\frac{2\ast \text{Prec}\ast \text{Rec}}{\text{Prec}+\text{Rec}}\text{}$ (10)

The relationship between the true positive rate and the false positive rate is called the ROC curve, and the ROC curve is used to verify the performance of a classifier model. The area under the curve (AUC) is a valid measure of the ROC curve and is an indicator of the comparison of different ROC curves.

5. Results

5.1. Ten Times Ten Fold Cross Validation Results

In this paper, ten times of ten-fold cross-validation is used to verify the model established by different data mining methods. The 10% CV error rate results are as follows:

The 10% CV error rate of the 7th 10-fold cross-validation is extracted. The result is shown in Figure 3. It can be seen that the 10% CV error rate of the five data mining methods has a certain fluctuation, but the fluctuation range and fluctuation times of LightGBM is less than the others.

Table 2. Confusion matrix.

Figure 3. The seventh times 10-fold CV error rate.

Table 3 shows the average 10% CV error rate of the five methods. It can be seen from Table 3 that the 10% CV error rate of the five methods is low, indicating the five data mining methods have certain reliability. The average 10% CV error rate difference between the five methods is small, but LightGBM’s 10 average 10% CV error rate is slightly lower than the other four methods.

5.2. Classification Results

The classification results obtained from 10-fold cross-validation are shown in Table 4.

From Table 4 we can know that the accuracy rates of the five data mining methods are all above 79%, and the difference is not large. The correct rate of LightGBM is 82.29%, which indicates that these five methods have better classification effects. AUC has a big difference. LightGBM has an AUC of 0.7904, and the other four methods have lower AUCs than LightGBM. At the same time, LightGBM is 89.34% higher than the other methods, indicating that LightGB has the best classification effect on the classification problem of this paper.

6. Conclusion

This paper discusses the classification effect of five data mining methods on classification problems. Taking a typical credit card default data set as an example, a classifier model is established. With a 10-fold cross-validation, we know that the five classifier models are reliable and stability. Ten times of 10-fold

Table 3. The mean of 10 times 10-fold CV error rate.

Table 4. Comparison of model classification effect.

cross-validation was performed to obtain the average AUC and correct rate of the model, and LightGBM was the highest among the three evaluation indicators, indicating that the data mining method has a good classification effect, and the classification effect is better than other four data mining methods.

Conflicts of Interest

The authors declare no conflicts of interest.

[1] |
Lyn, C. and Thomas, A. (2000) Survey of Credit and Behavioral Scoring: Forecasting Financial Risk of Lending to Consumers. International Journal of Forecasting, 16, 149-172. https://doi.org/10.1016/S0169-2070(00)00034-0 |

[2] |
Yeh, I.-C. and Lien, C.-H. (2009) The Comparisons of Data Mining Techniques for the Predictive Accuracy of Probability of Default of Credit Card Clients. Expert Systems with Applications, 36, 2473-2480.
https://doi.org/10.1016/j.eswa.2007.12.020 |

[3] | Mei, R.T., Xu, Y. and Wang, G.C. (2016) Analysis of Credit Card Default Prediction Model and Its Influencing Factors. Statistics and Application, 5, 263-275. |

[4] | Ye, Q.Y., Rao, H. and Ji, M.S. (2017) Business Sales Forecast Based on XGBOOST. Journal of Nanchang University, No. 3, 275-281. |

[5] | Guo, L.K., Qi, M., Finley, T., Wang, T.F., Chen, W., Ma, W.D., Ye, Q.W. and Liu, T.-Y. (2017) LightGBM: A Highly Efficient Gradient Boosting Decision Tree. 31st Conference on Neural Information Processing Systems (NIPS 2017), Long Beach, CA, USA, 4-9 December 2017, 1-9. |

[6] | Powers, D.M.W. (2011) Evaluation: From Precision, Recall and F-Measure to Roc, Informedness, Markedness & Correlation. Journal of Machine Learning Technologies, 2, 37-63. |

Journals Menu

Contact us

+1 323-425-8868 | |

customer@scirp.org | |

+86 18163351462(WhatsApp) | |

1655362766 | |

Paper Publishing WeChat |

Copyright © 2024 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.