Efficiency of gradient boosting decision trees technique in polish companies’ bankruptcy prediction

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

Abstract

The goal of the research was to compare the selected traditional bankruptcy prediction models, namely linear discriminant analysis and logit (logistic) models, with the technique called Gradient Boosting. In particular, the paper verifies two research hypotheses (verification was based on the balanced sample of Polish companies): [H1]: Gradient Boosted Decision Trees algorithm is more accurate than traditional bankruptcy prediction models: logit and discriminant analysis; [H2]: Boosted Decision Trees use both: financial ratios and normalized data from financial statements, but the same accuracy one can achieve only with the normalized data and the bigger number of weak learners.

Cite

CITATION STYLE

APA

Wyrobek, J., & Kluza, K. (2019). Efficiency of gradient boosting decision trees technique in polish companies’ bankruptcy prediction. In Advances in Intelligent Systems and Computing (Vol. 854, pp. 24–35). Springer Verlag. https://doi.org/10.1007/978-3-319-99993-7_3

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