Learning job representation using directed graph embedding

3Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In recent years, embedding technologies have gained popularity in many areas of machine learning, such as NLP, computer vision, information retrieval, etc.. In this paper, we propose a latent representation of job positions consisting of job title and company pairs, which can capture not only similarity relations but also ordering relations among job positions. We first construct a directed graph of job positions from the user's job transition history in the resume data, then we train the job position embedding using an asymmetric relation preserving graph embedding algorithm. Experimental results on a career move prediction task using real-world data set demonstrated that the proposed embedding solution can outperform state-of-the-art embedding methods.

Cite

CITATION STYLE

APA

Luo, H., Ma, S., Selvaraj, A. J. B., & Sun, Y. (2019). Learning job representation using directed graph embedding. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery. https://doi.org/10.1145/3326937.3341263

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free