Query-based versus tree-based classification: Application to banking data

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The cornerstone of retail banking risk management is the estimation of the expected losses when granting a loan to the borrower. The key driver for loss estimation is probability of default (PD) of the borrower. Assessing PD lies in the area of classification problem. In this paper we apply FCA query-based classification techniques to Kaggle open credit scoring data. We argue that query based classification allows one to achieve higher classification accuracy as compared to applying classical banking models and still to retain interpretability of model results, whereas black-box methods grant better accuracy but diminish interpretability.

Cite

CITATION STYLE

APA

Masyutin, A., & Kashnitsky, Y. (2017). Query-based versus tree-based classification: Application to banking data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10352 LNAI, pp. 664–673). Springer Verlag. https://doi.org/10.1007/978-3-319-60438-1_65

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