K-plus-nearest neighbor method development for credit scoring machine learning tasks
DOI:
https://doi.org/10.15587/1729-4061.2015.43730Keywords:
k-nearest neighbor method, credit scoring, binary classification, structured query languageAbstract
The pace of development of modern risk management and data mining technologies causes the relevance of searching for new or improved effective methods for statistical and non-statistical forecasting, as well as forming the problems of deep study of existing methods and characteristics of their application conditions. Machine learning, namely memory-based learning is one of the most practically useful, broad and insufficiently studied areas. Also, the development of modern information technologies and ways to improve readability and simplicity of code causes the relevance of the study support with the implementation of the fourth-generation programming language.
The research deals with developing basic and advanced k-plus-nearest neighbor method as significantly improved classical k-nearest neighbor method with eliminated shortcomings and inaccuracies of practical realization: the problem of selecting a metric space and the metrics itself, problem of using categorical (including sampled) variables on the set, the issue of probabilistic classification, problem of taking into account equally spaced groups of elements relative to the element to be classified, the model optimality criterion based on the method and the method of its use for selecting the optimal parameter, ways to accelerate application. The main work is focused on using the methodology and indicators of credit scoring in machine learning problems. The full code for the basic proposed method in the SQL language - MS SQL (T-SQL) dialect was given.
As a result of the study, efficiency was determined at the stage of applying the basic proposed method in terms of the optimality criterion - Gini index relative to probabilistic forecasts compared to logistic regression in terms of two factors: the quality of forecasts and number of parameters to be optimized.
The practical value of the results obtained on the example of simulation using mass consumer credit data lies in the simplicity and effectiveness of the proposed method by means only of the server part of the DBMS.
References
- Barbaumov, V. E., Rogov, M. A., Shchukin, D. F. et al.; Lobanov, A. A., Chugunov, A. V. (Eds.) (2003). Entsiklopediya finansovogo risk-menedzhmenta. Moscow: Alpina Pablisher, 786.
- Siddiqi, N. (2006). Credit risk scorecards: developing and implementing intelligent credit scoring. Hoboken: John Wiley & Sons, Inc., 196.
- Thomas, L. C., Edelman, D. B., Crook, J. N. (2002). Credit Scoring and its Applications: Monograph. Philadelphia: SIAM, 248.
- Wang, W., Vlatsa, D. A., Glennon, D. C. et al.; Mays, E., Voronenko, D. I. (Eds.) (2008). Rukovodstvo po kreditnomu skoringu. Minsk: Grevtsov Pablisher, 464.
- Soloshenko, O. M. (2014). Adjustment of the iterative reclassification method for including the rejected applications into the credit scoring. Research bulletin of NTUU “KPI”, 5, 63–69.
- Soloshenko, O. M. (2014). Kullback–Leibler divergence research for the simulation of the credit scoring. The Development of the Informational and Resource Providing of Science and Education in the Mining and Metallurgical and the Transportation Sectors 2014: conference proceedings. Dnepropetrovsk, Ukraine: National Mining University, 328–333.
- Soloshenko, O. M. (2015). The way of assessing the Gini coefficient, the Kolmogorov-Smirnov statistics and the Mahalanobis distance in credit scoring using SQL language possibilities. Research bulletin of NTUU “KPI”, 1, 29–35.
- Haykin, S. (2005). Neural networks: a comprehensive foundation. 2nd edition. Delhi: Pearson Education, Inc., 823.
- Ben-Gan, I. (2012). Microsoft® SQL Server® 2012 T-SQL fundamentals. Sebastopol: O’Reilly Media, Inc., 412.
- Ben-Gan, I. (2012). Microsoft® SQL Server® 2012 high-performance T-SQL using window functions. Sebastopol: O’Reilly Media, Inc., 221.
- Terentiev, O. M. (2009). Modeli i metody pobudovy ta analizu baiesivskyh merezh dlya intelektualnogo analizu danyh. Kiev, 258.
- Allison, P. D. (1999). Logistic regression using the SAS® system: theory and application. Cary: SAS Institute Inc., 287.
- Spipunov, A. B., Baldin, E. M., Volkova, P. A. et al. (2014). Naglyadnaya statistica. Ispolzuem R! Moscow: DMK Press, 298.
- Egorova, I., Egorov, S. (2012). Software implementation of classification methods. Eastern-European Journal of Enterprise Technologies, 1/5(43), 52–54. AVailable at: http://journals.uran.ua/eejet/article/view/2579/2384
- Keller, J. M., Gray, M. R., Givens, J. A. (1985). A fuzzy K-nearest neighbor algorithm. IEEE Transactions on Systems, Man, and Cybernetics, SMC-15 (4), 580–585. doi: 10.1109/tsmc.1985.6313426
- Berzlev, O. (2013). A method of increment signs forecasting of time series. Eastern-European Journal Of Enterprise Technologies, 2/4(62), 8–11. Available at: http://journals.uran.ua/eejet/article/view/12362/10250
- Soloshenko, O. M. (2014). Adaptatsiya formul pidrahunku vag kategorii zminnoi ta znachennya informatsii zminnoi pry vidomomu rozpodili kategorii ta vidomyh umovnyh ymovirnostyah negatyvnyh zhachen tsilovoi zminnoi. Problems of science, 10 (166), 45–47.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2015 Олександр Миколайович Солошенко
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
A license agreement is a document in which the author warrants that he/she owns all copyright for the work (manuscript, article, etc.).
The authors, signing the License Agreement with TECHNOLOGY CENTER PC, have all rights to the further use of their work, provided that they link to our edition in which the work was published.
According to the terms of the License Agreement, the Publisher TECHNOLOGY CENTER PC does not take away your copyrights and receives permission from the authors to use and dissemination of the publication through the world's scientific resources (own electronic resources, scientometric databases, repositories, libraries, etc.).
In the absence of a signed License Agreement or in the absence of this agreement of identifiers allowing to identify the identity of the author, the editors have no right to work with the manuscript.
It is important to remember that there is another type of agreement between authors and publishers – when copyright is transferred from the authors to the publisher. In this case, the authors lose ownership of their work and may not use it in any way.