首页> 外文会议>IEEE International Conference on Research Challenges in Information Science >Taxonomy-based job recommender systems on Facebook and LinkedIn profiles
【24h】

Taxonomy-based job recommender systems on Facebook and LinkedIn profiles

机译:在Facebook和LinkedIn个人资料上基于分类的工作推荐系统

获取原文

摘要

This paper presents taxonomy-based recommender systems that propose relevant jobs to Facebook and LinkedIn users; they are being developed by Work4, a San Francisco-based software company and the Global Leader in Social and Mobile Recruiting that offers Facebook recruitment solutions; to use its applications, Facebook or LinkedIn users explicitly grant access to some parts of their data, and they are presented with the jobs whose descriptions are matching their profiles the most. In this paper, we use the O*NET-SOC taxonomy, a taxonomy that defines the set of occupations across the world of work, to develop a new taxonomy-based vector model for social network users and job descriptions suited to the task of job recommendation; we propose two similarity functions based on the AND and OR fuzzy logic's operators, suited to the proposed vector model. We compare the performance of our proposed vector model to the TF-IDF model using our proposed similarity functions and the classic heuristic measures; the results show that the taxonomy-based vector model outperforms the TF-IDF model. We then use SVMs (Support Vector Machines) with a mechanism to handle unbalanced datasets, to learn similarity functions from our data; the learnt models yield better results than heuristic similarity measures. The comparison of our methods to two methods of the literature (a matrix factorization method and the Collaborative Topic Regression) shows that our best method yields better results than those two methods in terms of AUC. The proposed taxonomy-based vector model leads to an efficient dimensionality reduction method in the task of job recommendation.
机译:本文介绍了基于分类的推荐系统,可以为Facebook和LinkedIn用户提供相关工作。它们是由旧金山的软件公司Work4和提供Facebook招聘解决方案的全球社交和移动招聘全球领导者开发的;要使用其应用程序,Facebook或LinkedIn用户会明确授予访问其数据某些部分的权限,并且向其显示其描述与他们的个人资料最匹配的工作。在本文中,我们使用O * NET-SOC分类法,该分类法定义了整个工作世界中的职业集合,从而为社交网络用户和适合工作任务的工作描述开发了基于分类法的新矢量模型推荐;我们基于AND和OR模糊逻辑运算符,提出了两个相似性函数,适用于所提出的矢量模型。我们使用拟议的相似度函数和经典启发式方法将拟议的矢量模型与TF-IDF模型的性能进行比较;结果表明,基于分类的向量模型优于TF-IDF模型。然后,我们将SVM(支持向量机)与一种用于处理不平衡数据集的机制一起使用,以从我们的数据中学习相似性函数;与启发式相似性测度相比,学习的模型产生更好的结果。我们的方法与文献中的两种方法(矩阵分解方法和协作主题回归)的比较表明,就AUC而言,我们最好的方法比这两种方法产生更好的结果。提出的基于分类法的矢量模型在工作推荐任务中导致了一种有效的降维方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号