Evolution strategy based adaptive L_q penalty support vector machines with Gauss kernel for credit risk analysis

详细信息	查看全文 | 推荐本文 |

• 作者：Jianping Li^a ; ^{ljp@casipm.ac.cn} ; Gang Li^a ; ^b ; ^{ligang@casipm.ac.cn} ; Dongxia Sun^a ; ^b ; ^{sdxnyb@163.com} ; Cheng-Few Lee^c ; ^{lee@business.rutgers.edu}
• 关键词：Adaptive penalty ; Support vector machine ; Credit risk classification ; Evolution strategy
• 刊名：Applied Soft Computing Journal
• 出版年：2012
• 期刊代码：9_15684946
• 类别：cp
• 出版时间：August, 2012
• 卷：12
• 期：8
• 页码：2675-2682
• 文件大小：376 K

摘要

Credit risk analysis has long attracted great attention from both academic researchers and practitioners. However, the recent global financial crisis has made the issue even more important because of the need for further enhancement of accuracy of classification of borrowers. In this study an evolution strategy (ES) based adaptive L_q SVM model with Gauss kernel (ES-AL_qG-SVM) is proposed for credit risk analysis. Support vector machine (SVM) is a classification method that has been extensively studied in recent years. Many improved SVM models have been proposed, with non-adaptive and pre-determined penalties. However, different credit data sets have different structures that are suitable for different penalty forms in real life. Moreover, the traditional parameter search methods, such as the grid search method, are time consuming. The proposed ES-based adaptive L_q SVM model with Gauss kernel (ES-AL_qG-SVM) aims to solve these problems. The non-adaptive penalty is extended to (0, 2] to fit different credit data structures, with the Gauss kernel, to improve classification accuracy.

For verification purpose, two UCI credit datasets and a real-life credit dataset are used to test our model. The experiment results show that the proposed approach performs better than See5, DT, MCCQP, SVM light and other popular algorithms listed in this study, and the computing speed is greatly improved, compared with the grid search method.