A scalable, high-performance Algorithm for hybrid job recommendations

Toon De Pessemier, K. Vanhecke, L. Martens
{"title":"A scalable, high-performance Algorithm for hybrid job recommendations","authors":"Toon De Pessemier, K. Vanhecke, L. Martens","doi":"10.1145/2987538.2987539","DOIUrl":null,"url":null,"abstract":"Recommender systems can be used as a tool to assist people in finding a job. However, this specific domain requires expert algorithms with domain knowledge to recommend jobs conformable to people's expertise and interests. This is the topic of the Recsys Challenge 2016, which aims for an algorithm that predicts the job postings that a user will positively interact with. Our solution is a hybrid algorithm combining a content-based and KNN approach. The content-based algorithm matches features of candidate recommendations and job postings of historical interactions. The KNN approach searches for the job postings that are the most similar to the postings the user interacted with in the past. The resulting combination is a lightweight algorithm that is fast and scalable, generating recommendations with a proper evaluation score.","PeriodicalId":127880,"journal":{"name":"RecSys Challenge '16","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"RecSys Challenge '16","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2987538.2987539","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

Abstract

Recommender systems can be used as a tool to assist people in finding a job. However, this specific domain requires expert algorithms with domain knowledge to recommend jobs conformable to people's expertise and interests. This is the topic of the Recsys Challenge 2016, which aims for an algorithm that predicts the job postings that a user will positively interact with. Our solution is a hybrid algorithm combining a content-based and KNN approach. The content-based algorithm matches features of candidate recommendations and job postings of historical interactions. The KNN approach searches for the job postings that are the most similar to the postings the user interacted with in the past. The resulting combination is a lightweight algorithm that is fast and scalable, generating recommendations with a proper evaluation score.
一种可扩展的高性能混合工作推荐算法
推荐系统可以作为一种工具来帮助人们找工作。然而,这个特定的领域需要具有领域知识的专家算法来推荐符合人们专业知识和兴趣的工作。这是2016年Recsys挑战赛的主题,该挑战赛旨在开发一种算法,预测用户将与之积极互动的招聘信息。我们的解决方案是结合基于内容和KNN方法的混合算法。基于内容的算法匹配候选人推荐和历史交互职位发布的特征。KNN方法搜索与用户过去交互过的职位最相似的职位。结果组合是一个轻量级算法,它快速且可扩展,生成具有适当评估分数的建议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信