基于相似性匹配,为员工推荐既个性化又符合职业理想的晋升路径。
Personalized and Aspiration-Oriented Career Path Recommendation
- 用事件序列嵌入和动态对齐计算职业路径相似性,无需领域知识。
- 引入理想目标匹配度,使推荐更贴近个人职业愿景。
- 基于时间序列的深度学习方法在排序效果上优于传统规则方法。
实现员工职业理想对个人与组织发展至关重要。本文提出一种数据驱动的方法,为特定求职者推荐个性化且契合其职业理想的晋升路径。该方法结合职业路径相似性(CPS)与理想目标相似性(AS)进行筛选:CPS保证推荐的个性化,AS确保理想达成。我们提出两种计算CPS的方法——(a)基于领域知识的特征提取(DKD),以及(b)无监督表示学习与对齐(URLA)。在URLA中,利用员工职业路径中的事件名称序列,通过LSTM网络学习每个事件名称的嵌入向量,并结合技能簇与领域属性,使用加权余弦距离与最优莱文斯坦对齐实现路径间最佳匹配。我们假设事件序列中的相对位置蕴含语义信息,可被模型学习。同时定义了两种方法下的理想目标匹配策略,融合CPS与AS对候选路径进行排序。实验表明,URLA方法在DCG指标上优于DKD,且排序结果具有一致性。其优势在于无需依赖领域知识,且通过动态对齐捕捉了时间维度信息。
原文摘要 · Abstract (English)
Fulfilling career aspirations is important for growth of employee and organization. We propose a data driven methodology to recommend personalized career path for a given aspirant's career path and aspirations. The pro-posed method uses the career path similarity (CPS) between aspirant's career and candidate career path, and 'aspirational similarity' (AS) between aspiration and candidate career paths to find suitable career path. CPS ensures personalized recommendation while AS ensures aspiration fulfillment. We defined two methods to compute the CPS between career paths which are (a) domain knowledge driven (DKD) and, (b) unsupervised representation learning and alignment (URLA) based, along with different AS measures. The DKD based similarity is defined in the terms of features extracted and summarized over career paths. In the URLA, we use the sequence of event names present in the career paths of the employees to learn the embedding for each event name. In URLA we use learned embedding vector of the career path event names and as-sociated event attributes (skill cluster and domain) to find the best alignment between two career paths. We hypothesized that relative position of event names in the sequence represents semantics of event name and that can be learned. We use LSTM neural network to learn the embedding vector of each career event name. We also define the matching method to compute the AS be-tween aspiration and career path in both proposed methods. We combine CPS and AS to rank available 'candidate career paths' of employees to find the suitable one. We get better DCG value in URLA as compare to DKD. We also showed that ranking are coherent using both the methods. URLA method is better since it does not require domain knowledge to model the similarity and includes temporal aspect by optimal Levenshtein alignment using weighted cosine distance.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。