Applying machine learning algorithms to determine and predict the reasons and models for employee turnover
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In recent years, organisations have struggled with the turnover of employees, which has become one of the biggest issues that not only has inadvertent consequences for an organisation's growth, productivity, and performance but also has negative implications for the intrinsic cost associated with it.To cater to this problem, one such method is the use of machine learning algorithms.But one of the biggest issues in HR information system (HRIS) analysis is the presence of noise in data, leading to inaccurate predictions.This paper tries to examine the efficiency of six such algorithms, to determine the robustness, accuracy in real-time analysis of data, and then use that company's historical data to predict employee turnover for the present year.The dataset was mined from the HRIS database of a global organisation in the USA and Canada in the span of ten years to compare these algorithms to examine voluntary turnover, using Python and RStudio analytical tools.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it