IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05238451.html
   My bibliography  Save this paper

Bankruptcy prediction using the XGBoost algorithm and variable importance feature engineering

Author

Listed:
  • Sami Ben Jabeur

    (UR CONFLUENCE : Sciences et Humanités (EA 1598) - UCLy - UCLy (Lyon Catholic University), ESDES - ESDES, Lyon Business School - UCLy - UCLy - UCLy (Lyon Catholic University))

  • Nicolae Stef
  • Carmona Pedro

Abstract

The emergence of big data, information technology, and social media provides an enormous amount of information about firms' current financial health. When facing this abundance of data, decision makers must identify the crucial information to build upon an effective and operative prediction model with a high quality of the estimated output. The feature selection technique can be used to select significant variables without lowering the quality of performance classification. In addition, one of the main goals of bankruptcy prediction is to identify the model specification with the strongest explanatory power. Building on this premise, an improved XGBoost algorithm based on feature importance selection (FS-XGBoost) is proposed. FS-XGBoost is compared with seven machine learning algorithms based on three well-known feature selection methods that are frequently used in bankruptcy prediction: stepwise discriminant analysis, stepwise logistic regression, and partial least squares discriminant analysis (PLS-DA). Our experimental results confirm that FS-XGBoost provides more accurate predictions, outperforming traditional feature selection methods.

Suggested Citation

  • Sami Ben Jabeur & Nicolae Stef & Carmona Pedro, 2023. "Bankruptcy prediction using the XGBoost algorithm and variable importance feature engineering," Post-Print hal-05238451, HAL.
  • Handle: RePEc:hal:journl:hal-05238451
    DOI: 10.1007/s10614-021-10227-1
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-05238451. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.