Advertisement

Credit Scoring Based on Kernel Matching Pursuit

  • Jianwu Li
  • Haizhou Wei
  • Chunyan Kong
  • Xin Hou
  • Hong Li
Part of the Communications in Computer and Information Science book series (CCIS, volume 375)

Abstract

Credit risk is paid more and more attention by financial institutions, and credit scoring has become an active research topic. This paper proposes a new credit scoring method based on kernel matching pursuit (KMP). KMP appends sequentially basic functions from a kernel-based dictionary to an initial empty basis using a greedy optimization algorithm, to approximate a given function, and obtain the final solution with a linear combination of chosen functions. An outstanding advantage of KMP in solving classification problems is the sparsity of its solution. Experiments based on two real data sets from UCI repository show the effectiveness and sparsity of KMP in building credit scoring model.

Keywords

Credit scoring Kernel matching pursuit Support vector machine 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Myers, J.H., Forgy, E.W.: The development of numerical credit evaluation systems. Journal of the American Statistical Association 58(303), 799–806 (1963)CrossRefGoogle Scholar
  2. 2.
    Wiginton, J.C.: A note on the comparison of logit and discriminant models of consumer credit behavior. Journal of Financial Quantitative Analysis 15(3), 757–770 (1980)CrossRefGoogle Scholar
  3. 3.
    Zhou, X.Y., Zhang, D.F., Jiang, Y.: A new credit scoring method based on rough sets and decision tree. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 1081–1089. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  4. 4.
    West, D.: Neural network credit scoring models. Computers and Operations Research 27(11-12), 1131–1152 (2000)zbMATHCrossRefGoogle Scholar
  5. 5.
    Abdou, H.A.: Genetic programming for credit scoring: The case of Egyptian public sector banks. Expert Systems with Applications 36(9), 11402–11417 (2009)CrossRefGoogle Scholar
  6. 6.
    Chuang, C.L., Lin, R.H.: Constructing a reassigning credit scoring model. Expert Systems with Applications 36(2), 1685–1694 (2009)CrossRefGoogle Scholar
  7. 7.
    Zhou, L., Lai, K.K., Yu, L.: Credit scoring using support vector machines with direct search for parameters selection. Soft Comput. 13, 149–155 (2009)zbMATHCrossRefGoogle Scholar
  8. 8.
    Vincent, P., Bengio, Y.: Kernel Matching Pursuit. Machine Learning 48, 165–187 (2002)zbMATHCrossRefGoogle Scholar
  9. 9.
    Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. School of Information and Computer Science, University of California(2007), http://www.ics.uci.edu/~mlearn/MLRepository.html

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Jianwu Li
    • 1
  • Haizhou Wei
    • 1
  • Chunyan Kong
    • 1
  • Xin Hou
    • 1
  • Hong Li
    • 1
  1. 1.Beijing Key Lab of Intelligent Information Technology, School of Computer Science and TechnologyBeijing Institute of TechnologyBeijingChina

Personalised recommendations