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

被引:15
作者
Li, Jianping [1 ]
Li, Gang [1 ,2 ]
Sun, Dongxia [1 ,2 ]
Lee, Cheng-Few [3 ]
机构
[1] Chinese Acad Sci, Inst Policy & Management, Beijing 100190, Peoples R China
[2] Chinese Acad Sci, Grad Univ, Beijing 100049, Peoples R China
[3] Rutgers State Univ, Rutgers Business Sch, Dept Finance & Econ, Piscataway, NJ 08854 USA
基金
美国国家科学基金会;
关键词
Adaptive penalty; Support vector machine; Credit risk classification; Evolution strategy; GENE-EXPRESSION DATA; CARDHOLDER BEHAVIOR; FEATURE-SELECTION; CLASSIFICATION; CLASSIFIERS; SVM;
D O I
10.1016/j.asoc.2012.04.011
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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(q)G-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(q)G-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. (C) 2012 Elsevier B. V. All rights reserved.
引用
收藏
页码:2675 / 2682
页数:8
相关论文
共 43 条
[1]   Neural nets versus conventional techniques in credit scoring in Egyptian banking [J].
Abdou, Hussein ;
Pointon, John ;
El-Masry, Ahmed .
EXPERT SYSTEMS WITH APPLICATIONS, 2008, 35 (03) :1275-1292
[2]   A neural network approach for credit risk evaluation [J].
Angelini, Eliana ;
di Tollo, Giacomo ;
Roli, Andrea .
QUARTERLY REVIEW OF ECONOMICS AND FINANCE, 2008, 48 (04) :733-755
[3]  
Arnold DV, 2002, IEEE T EVOLUT COMPUT, V6, P30, DOI [10.1109/4235.985690, 10.1023/A:1015059928466]
[4]   Massive data discrimination via linear support vector machines [J].
Bradley, PS ;
Mangasarian, OL .
OPTIMIZATION METHODS & SOFTWARE, 2000, 13 (01) :1-10
[5]   A tutorial on Support Vector Machines for pattern recognition [J].
Burges, CJC .
DATA MINING AND KNOWLEDGE DISCOVERY, 1998, 2 (02) :121-167
[6]   Mining the customer credit using hybrid support vector machine technique [J].
Chen, Weimin ;
Ma, Chaoqun ;
Ma, Lin .
EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (04) :7611-7616
[7]   A multiple kernel support vector machine scheme for feature selection and rule extraction from gene expression data of cancer tissue [J].
Chen, Zhenyu ;
Li, Jianping ;
Wei, Liwei .
ARTIFICIAL INTELLIGENCE IN MEDICINE, 2007, 41 (02) :161-175
[8]   Multiple-kernel SVM based multiple-task oriented data mining system for gene expression data analysis [J].
Chen, Zhenyu ;
Li, Jianping ;
Wei, Liwei ;
Xu, Weixuan ;
Shi, Yong .
EXPERT SYSTEMS WITH APPLICATIONS, 2011, 38 (10) :12151-12159
[9]   An efficient support vector machine cone programming for learning method with second-order large-scale problems [J].
Debnath, R ;
Muramatsu, M ;
Takahashi, H .
APPLIED INTELLIGENCE, 2005, 23 (03) :219-239
[10]   Ex-ray:: Data mining and mental health [J].
Diederich, Joachim ;
Al-Ajmi, Aqeel ;
Yellowlees, Peter .
APPLIED SOFT COMPUTING, 2007, 7 (03) :923-928