Credit scoring based on tree-enhanced gradient boosting decision trees
Expert Systems with Applications, ISSN: 0957-4174, Vol: 189, Page: 116034
2022
- 72Citations
- 90Captures
Metric Options: CountsSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
Credit scoring is an important tool for banks and lending companies to realize credit risk exposure management and gain profits. GBDTs, a group of boosting-type ensemble algorithms, have shown promising improvement for credit scoring. However, GBDT improves the credit scoring performance by iteratively modifying only the fitting target for each base classifier and invariably works on the same features, which limits the diversity of individual classifiers in GBDT; Moreover, the performance-interpretability dilemma motivated a large number of works to focus on the pursuit of high-performance ensemble strategies, which leads to the lack of explorations on the interpretability of the credit scoring models. Based on the above limitations, two tree-based augmented GBDTs (AugBoost-RFS and AugBoost-RFU) are proposed in this work for credit scoring. In the proposed methods, a step-wise feature augmentation mechanism is introduced for GBDT to enrich the diversity of individual base classifiers; Tree-based embedding technologies simplify the process of feature augmentation and inherit interpretability of GBDT. Results on 4 large-scale credit scoring datasets show AugBoost-RFS/AugBoost-RFU outperforms GBDT; Besides, supervised tree-based step-wise feature augmentation for GBDT achieves comparable results to neural network-based step-wise feature augmentation while significantly improve the augmentation efficiency. Moreover, the intrinsic global interpreted results and decision rules of tree-enhanced GBDTs, as well as the marginal contributions of features that are visualized by TreeSHAP demonstrate AugBoost-RFS/AugBoost-RFU can be good candidates for interpretable credit scoring.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0957417421013798; http://dx.doi.org/10.1016/j.eswa.2021.116034; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85117808285&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0957417421013798; https://dx.doi.org/10.1016/j.eswa.2021.116034
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know