An Resignation Prediction Method Based on KTE-SMOTE

Aiming at the data imbalance problem in employee resignation prediction, this paper proposes a method based on the improved SMOTE algorithm. The data imbalance problem is one of the main challenges in employee resignation prediction, and the traditional SMOTE algorithm often suffers from sample generation bias and over-generation of samples in the central region when dealing with imbalanced data, which leads to poor performance of the prediction model. In order to solve these problems, this paper proposes a KTE-SMOTE algorithm, which improves the stability of the algorithm by introducing the k-means algorithm, selecting the optimal number of clusters k by using Silhouette Coefficient, combining with under-sampling of Tomek Links, and smoothing the boundary when generating samples by edge smoothing technique. Finally, ENN is used for data cleaning to ensure the diversity of generated samples and the clarity of boundary samples. The experimental results show that the KTE-SMOTE algorithm exhibits better performance than the traditional SMOTE algorithm in a variety of machine learning models.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/iccc62609.2024.10941952
Primary Topic
IPv6, Mobility, Handover, Networks, Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Resignation Prediction Method Based on KTE-SMOTE

H. Y. Zhao, Yaoxiang Yu, Sheng Wang, Bo Yu
IPv6, Mobility, Handover, Networks, Security
article

An Resignation Prediction Method Based on KTE-SMOTE

H. Y. Zhao, Yaoxiang Yu, Sheng Wang, Bo Yu
article en

Abstract

Aiming at the data imbalance problem in employee resignation prediction, this paper proposes a method based on the improved SMOTE algorithm. The data imbalance problem is one of the main challenges in employee resignation prediction, and the traditional SMOTE algorithm often suffers from sample generation bias and over-generation of samples in the central region when dealing with imbalanced data, which leads to poor performance of the prediction model. In order to solve these problems, this paper proposes a KTE-SMOTE algorithm, which improves the stability of the algorithm by introducing the k-means algorithm, selecting the optimal number of clusters k by using Silhouette Coefficient, combining with under-sampling of Tomek Links, and smoothing the boundary when generating samples by edge smoothing technique. Finally, ENN is used for data cleaning to ensure the diversity of generated samples and the clarity of boundary samples. The experimental results show that the KTE-SMOTE algorithm exhibits better performance than the traditional SMOTE algorithm in a variety of machine learning models.

Shenyang Institute of Computing Technology (China) (CN), University of Chinese Academy of Sciences (CN)
Climate action
Openalex Percentile: Top 73%
IPv6, Mobility, Handover, Networks, Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.