DBGE: Employee Turnover Prediction Based on Dynamic Bipartite Graph Embedding

Abstract

The issue of employee turnover is always critical for companies, and accurate predictions can help them prepare in time. Most past studies on employee turnover have focused on analyzing impact factors or using simple network centrality measures. In this paper, we study the problem from a completely new perspective by modeling users' historical job records as a dynamic bipartite graph. Specifically, we propose a bipartite graph embedding method with temporal information called dynamic bipartite graph embedding (DBGE) to learn the vector representation of employees and companies. Our approach not only considers the relations between employees and companies but also incorporates temporal information embedded in consecutive work records. We first define the Horary Random Walk on a bipartite graph to generate a sequence for each vertex in chronological order. Then, we employ the skip-gram model to obtain a temporal low-dimensional vector representation for each vertex and apply machine learning methods to predict employee turnover behavior by combining embedded features with employees' basic information. Experiments on a real-world dataset collected from one of China's largest online professional social networks show that the features learned through DBGE can significantly improve turnover prediction performance. Moreover, experiments on public Amazon and Taobao datasets show that our approach achieves better performance in the link prediction and visualization task than other graph embedding methods that do not consider temporal information.

Keywords

• Graph embedding
• employee turnover prediction
• dynamic bipartite graph
• horary random walk