IDEAS home Printed from https://ideas.repec.org/a/ids/ijenma/v17y2026i1p72-93.html

Enhancement of new random forest algorithm to predict the employee attrition rate

Author

Listed:
  • Rukma Ramachandran
  • Vijaya Prabhagar Murugesan
  • Vimal Babu

Abstract

The problem of employee attrition in every organisation is concerning the employee turnover ratio thereby increasing the cost of investment in human resources. Various factors are reasonable for the rapid attritions at different phased. The purpose of the current study is to predict the employees who are likely to leave the organisation. The factors that lead to attrition are identified using random forest algorithm. Random forest algorithm is a widely used supervised machine learning technique for classification and prediction. However, the random forest algorithm has certain issue like it is too slow and ineffective for real-time predictions, i.e., the large number of trees can make the algorithm, which results in slower model. Therefore, the study proposes, a new alternative for choosing the appropriate decision trees based on the concept of fractional factorial design of experiments. The different performance criteria were compared across the modified random forest algorithm, existing random forest algorithm, support vector machine (SVM), logistic regression (LR), Naïve Bayes (NB), K-nearest neighbour (K-NN), decision tree, XGBoost tree and neural network (NN). It was found that the modified random forest algorithm excelled in all criteria and performed better than the existing ones.

Suggested Citation

  • Rukma Ramachandran & Vijaya Prabhagar Murugesan & Vimal Babu, 2026. "Enhancement of new random forest algorithm to predict the employee attrition rate," International Journal of Enterprise Network Management, Inderscience Enterprises Ltd, vol. 17(1), pages 72-93.
  • Handle: RePEc:ids:ijenma:v:17:y:2026:i:1:p:72-93
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=152908
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

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

    for a different version of it.

    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:ids:ijenma:v:17:y:2026:i:1:p:72-93. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=187 .

    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.