IDEAS home Printed from https://ideas.repec.org/a/taf/tjmaxx/v13y2026i1p109-138.html

A comparative analysis of ensemble learning models for predicting lapses in investment policies

Author

Listed:
  • Lerato Matlala
  • Tebogo Bokaba
  • Patrick Ndayizigamiye
  • Siyabonga Mhlongo
  • Eustace Dogo

Abstract

This study explores the application of machine learning (ML) algorithms to predict lapses in investment policies, addressing a big challenge for insurance and financial services companies. The study compares three ensemble techniques: random forest (RF), gradient boosting (GB), and extreme gradient boosting (XGBoost), to identify the most effective model for predicting policy lapses and to determine the key factors influencing these predictions. The dataset used for this analysis is sourced from an anonymous insurance and financial services company on Kaggle, and includes data from 51,685 policies spanning from 2017 to 2020. Thorough data pre-processing, including handling missing values, outlier treatment, and feature scaling, is performed before training and evaluating the models. The results reveal that features such as tenure, number of missed payments, and total sum assured play a big role in predicting lapses. Random Forest is identified as the top-performing model. Furthermore, local interpretable model-agnostic explanations (LIME) is used to improve interpretability, offering detailed insights into feature contributions. These findings suggest that ML models, particularly Random Forest, are highly effective in predicting lapses in investment policies, offering valuable insights for insurance and financial services companies to manage and reduce policy lapses.

Suggested Citation

  • Lerato Matlala & Tebogo Bokaba & Patrick Ndayizigamiye & Siyabonga Mhlongo & Eustace Dogo, 2026. "A comparative analysis of ensemble learning models for predicting lapses in investment policies," Journal of Management Analytics, Taylor & Francis Journals, vol. 13(1), pages 109-138, January.
  • Handle: RePEc:taf:tjmaxx:v:13:y:2026:i:1:p:109-138
    DOI: 10.1080/23270012.2025.2574030
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/23270012.2025.2574030
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/23270012.2025.2574030?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    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:taf:tjmaxx:v:13:y:2026:i:1:p:109-138. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjma .

    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.