scholarly journals Credit Scoring Using Classification and Regression Tree (CART) Algorithm and Binary Particle Swarm Optimization

Author(s):  
Reza Firsandaya Malik ◽  
Hermawan Hermawan

<span>Credit scoring is a procedure that exists in every financial institution. A way to predict whether the debtor was qualified to be given the loan or not and has been a major concern in the overall steps of the loan process. Almost all banks and other financial institutions have their own credit scoring methods. Nowadays, data mining approach has been accepted to be one of the well-known methods. Certainly, accuracy was also a major issue in this approach. This research proposed a hybrid method using CART algorithm and Binary Particle Swarm Optimization. Performance indicators that are used in this research are classification accuracy, error rate, sensitivity, specificity, and precision. Experimental results based on the public dataset showed that the proposed method accuracy is 78 %. In compare to several popular algorithms, such as neural network, logistic regression and support vector machine, the proposed method showed an outstanding performance. </span>

Author(s):  
Mohammad Reza Daliri

AbstractIn this article, we propose a feature selection strategy using a binary particle swarm optimization algorithm for the diagnosis of different medical diseases. The support vector machines were used for the fitness function of the binary particle swarm optimization. We evaluated our proposed method on four databases from the machine learning repository, including the single proton emission computed tomography heart database, the Wisconsin breast cancer data set, the Pima Indians diabetes database, and the Dermatology data set. The results indicate that, with selected less number of features, we obtained a higher accuracy in diagnosing heart, cancer, diabetes, and erythematosquamous diseases. The results were compared with the traditional feature selection methods, namely, the F-score and the information gain, and a superior accuracy was obtained with our method. Compared to the genetic algorithm for feature selection, the results of the proposed method show a higher accuracy in all of the data, except in one. In addition, in comparison with other methods that used the same data, our approach has a higher performance using less number of features.


Author(s):  
YUN LING ◽  
QIUYAN CAO ◽  
HUA ZHANG

Consumer credit scoring is considered as a crucial issue in the credit industry. SVM has been successfully utilized for classification in many areas including credit scoring. Kernel function is vital when applying SVM to classification problem for enhancing the prediction performance. Currently, most of kernel functions used in SVM are single kernel functions such as the radial basis function (RBF) which has been widely used. On the basis of the existing kernel functions, this paper proposes a multi-kernel function to improve the learning and generalization ability of SVM by integrating several single kernel functions. Chaos particle swarm optimization (CPSO) which is a kind of improved PSO algorithm is utilized to optimize parameters and to select features simultaneously. Two UCI credit data sets are used as the experimental data to evaluate the classification performance of the proposed method.


Sign in / Sign up

Export Citation Format

Share Document