Comparing and Selecting SVM-Kernels for Credit Scoring

  • Stecking R
  • Schebesch K
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Kernel methods for classification problems map data points into feature spaces where linear separation is performed. Detecting linear relations has been the focus of much research in statistics and machine learning, resulting in efficient algorithms that are well understood, with many applications including credit scoring problems. However, the choice of more appropriate kernel functions using nonlinear feature mapping may still improve this classification performance. We show, how different kernel functions contribute to the solution of a credit scoring problem and we also show how to select and compare such kernels.

Cite

CITATION STYLE

APA

Stecking, R., & Schebesch, K. B. (2006). Comparing and Selecting SVM-Kernels for Credit Scoring. In From Data and Information Analysis to Knowledge Engineering (pp. 542–549). Springer-Verlag. https://doi.org/10.1007/3-540-31314-1_66

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free