USING THE LISP-MINER SYSTEM FOR CREDIT RISK ASSESSMENT

被引:3
作者
Berka, P. [1 ]
机构
[1] Univ Econ, Dept Informat & Knowledge Engn, W Churchill Sq 4, CZ-13067 Prague, Czech Republic
关键词
data mining; decision rules; association rules; credit scoring;
D O I
10.14311/NNW.2016.26.029
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Credit risk assessment, credit scoring and loan applications approval are one of the typical tasks that can be performed using machine learning or data mining techniques. From this viewpoint, loan applications evaluation is a classification task, in which the final decision can be either a crisp yes/no decision about the loan or a numeric score expressing the financial standing of the applicant. The knowledge to be used is inferred from data about past decisions. These data usually consist of both socio-demographic and economic characteristics of the applicant (e.g., age, income, and deposit), the characteristics of the loan, and the loan approval decision. A number of machine learning algorithms can be used for this purpose. In this paper we show how this task can be performed using the LISp-Miner system, a tool that is under development at the University of Economics, Prague. LISp-Miner is primarily focused on mining for various types of association rules, but unlike classical association rules proposed by Agrawal, LISp-Miner introduces a greater variety of different types of relations between the left-hand and right-hand sides of a rule. Two other procedures that can be used for classification task are implemented in LISp-Miner as well. We describe the 4ft-Miner and KEX procedures and show how they can be used to analyze data related to loan applications. We also compare the results obtained using the presented algorithms with results from standard rule-learning methods.
引用
收藏
页码:497 / 518
页数:22
相关论文
共 32 条
[1]  
Agrawal Rakesh, 1993, P ACM SIGMOD C MAN D, P207, DOI DOI 10.1145/170035.170072
[2]  
[Anonymous], 2012, TELKOMNIKA Indonesian J Electr Eng, DOI DOI 10.11591/TELKOMNIKA.V10I6.1323
[3]   Empirical comparison of various discretization procedures [J].
Berka, P ;
Bruha, I .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 1998, 12 (07) :1017-1032
[4]  
BERKA P., 1999, WORKSHOP NOTES DISCO
[5]   Learning compositional decision rules using the KEX algorithm [J].
Berka, Petr .
INTELLIGENT DATA ANALYSIS, 2012, 16 (04) :665-681
[6]   PRISM - AN ALGORITHM FOR INDUCING MODULAR RULES [J].
CENDROWSKA, J .
INTERNATIONAL JOURNAL OF MAN-MACHINE STUDIES, 1987, 27 (04) :349-370
[7]  
Changhwan Lee, 1994, ECAI 94. 11th European Conference on Artificial Intelligence. Proceedings, P428
[8]  
CHAPMAN P., 2000, STEP BY STEP DATA MI
[9]  
Chen W., 2012, Systems Engineering Procedia, V3, P194, DOI DOI 10.1016/j.sepro.2011.10.029
[10]  
Cohen W. W., 1995, Machine Learning. Proceedings of the Twelfth International Conference on Machine Learning, P115