Job and Candidate Recommendation with Big Data Support: A Contextual Online Learning Approach

摘要

To make every user conveniently have access to his or her most interested jobs and candidates (recommendation items) in the current employment market, the recruitment networks need to meet the demand of fast and accurate recommendation. But a key challenge is that the total items may have a large quantity in the big data scenarios. And another problem is that the personalization of different users is diverse. In order to handle these challenges, this paper proposes a mining and prediction system for job and candidate recommendation with contextual online learning. It predicts a proper item by utilizing the feedback reward of previous users in the nearby context region. Besides that, we introduce a Monte-Carlo Tree Search (MCTS) method in which the similar items can be amalgamated into a cluster to reduce the computing load. Our algorithm can achieve sublinear regret and space complexity. Finally, some experiments are conducted to test our algorithm based on a large database from emph{Work4} (the global leader in social and mobile recruiting), which can show the outstanding performance of our algorithm when compared with other existing algorithms.