arrow
Return

Credit risk evaluation with kernel-based affine subspace nearest points learning method

delete2011-04-01
delete21
PRE
AI
X
Xiaofei Zhou *
W
Wenhan Jiang
Y
Yong Shi
田英杰 (Yingjie Tian)
DOI:10.1016/j.eswa.2010.09.095delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Credit risk evaluation has long been an important and widely studied topic in bank lending decisions and profitability. Currently emerging data mining and machine learning techniques, such as support vector machine (SVM), have been discussed widely in credit risk evaluation. In this paper a new kernel-based learning method called kernel affine subspace nearest point (KASNP) approach is proposed for credit risk evaluation. KASNP approach is derived from the nearest point problem of SVM, which extends the areas searched for the nearest points from the convex hulls in SVM to affine subspaces. Similar to SVM, KASNP can also classify the typical nonlinear two-spiral problem well. But unlike SVM to solve the difficult convex quadratic programming problem, KASNP is an unconstrained optimal problem whose solution can be directly computed. We apply KASNP for credit evaluation, and the experiments on three credit datasets show that the proposed KASNP is more competitive for creditors classification. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Credit risk
Data mining
Classification
SVM
Kernel
Subspace
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Expert Systems with Applications cover
Expert Systems with Applications
IF:
7.5
Papers:
2.9W
Citations:
10.2W

Organization

U
university of chinese academy of sciences, cas
Scholars:
4.1W
Papers: 3.8W
Citations: 75
C
chinese academy of sciences
Scholars:
56.3W
Papers: 44.8W
Citations: 704