Utilization of Quantization Method on Credit Risk Assessment

Article Preview

Abstract:

Credit risk assessment is critical factor in credit risk management, which has played a key role in financial and banking industry. Many classification methods are used in credit risk assessment aiming to establish classifiers to predict the credit state of the corporate (good or bad). However, most of classification methods can not handle continuous variables. So, continuous variables must be quantified. In this paper, we first propose an improved quantization method, namely IDM, based on the statistical independence; then we use data mining techniques, i.e., C4.5 decision tree, Naive-Bayes and SVM classifier, to classify and predict the quantified credit data. The aim is to investigate the effect of quantization method on the classification of credit approval data. The Experimental results show that our approach significantly improves the mean accuracy of classification than other known quantization methods. This denotes that the proposed method can make an effective interpretation and point out the ability of design of a new intelligent assistance credit approval data system.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

432-436

Citation:

Online since:

January 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] T. Diana, Credit risk analysis and credit scoring-now and in the future, Business and Credit, p.1–3, (2009).

Google Scholar

[2] X. D. Wu, Top 10 algorithms in data mining, Knowledge Information System, vol. 14, no. 1, p.1–37, (2010).

Google Scholar

[3] J. Han and M. Kamber, Data mining: concepts and techniques, San Diego, CA: Morgan Kaufmann, (2001).

Google Scholar

[4] J. Dougherty, R. Kohavi, and M. Sahami, Supervised and unsupervised discretization of continuous feature, Machine learning: Proc. 12th Intl Conf., p.194–202, (1995).

DOI: 10.1016/b978-1-55860-377-6.50032-3

Google Scholar

[5] J. Y. Ching, A. K. C. Wong, and K. C. C. Chan, Class-dependent discretization for inductive learning from continuous and mixed-mode data, IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 7, p.641–651, (1995).

DOI: 10.1109/34.391407

Google Scholar

[6] L. A. Kurgan and K. J. Cios, Caim discretization algorithm, IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 2, p.145–153, (2004).

DOI: 10.1109/tkde.2004.1269594

Google Scholar

[7] C. T. Su and J. H. Hsu, An extended chi2 algorithm for discretization of real value attributes, IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, p.437–441, (2005).

DOI: 10.1109/tkde.2005.39

Google Scholar

[8] E. H. Tay and L. Shen, A modified chi2 algorithm for discretization, IEEE Transactions on Knowledge and Data Engineering, vol. 14, no. 3, p.666–670, (2002).

DOI: 10.1109/tkde.2002.1000349

Google Scholar

[9] S. Hettich and S. D. Bay, The uci kdd archive [db/ol], http: /kdd. ics. uci. edu/, (1999).

Google Scholar