Field selection for job categorization and recommendation to social network users

E. Malherbe, M. Diaby, Mario Cataldi, E. Viennet, Marie-Aude Aufaure
{"title":"Field selection for job categorization and recommendation to social network users","authors":"E. Malherbe, M. Diaby, Mario Cataldi, E. Viennet, Marie-Aude Aufaure","doi":"10.1109/ASONAM.2014.6921646","DOIUrl":null,"url":null,"abstract":"Nowadays, in the Web 2.0 reality, one of the most challenging task for companies that aim to manage and recommend job offers is to convey this enormous amount of information in a succinct and intelligent manner such to increase the performances of matching operations against users profiles/curricula and optimize the time/space complexity of these processes. With this goal, this paper presents a novel method to formalize the textual content of job offers that aims at identifying the most relevant information and fields expressed by them and leverage this compact formalization for job recommendation and profile matching in social network environments. This method has been then developed and tested in the industrial environment represented by Multiposting and Work4, world leaders in digital solutions of e-recruitment problems. In this study three classes of documents are considered: job offers, job categories and social network user profiles (as potential job candidates); each class contains several fields with textual information. The proposed representation method permits to dynamically identify those text fields, for each class, that could help a cross-matching strategy in order to preserve, from one hand, the matching/recommendation performances and, on the other hand, reduce the cost of these operations (due to a straightforward dimensionality reduction mechanism). We then evaluated and compared the presented approach showing significant improvements on both categorization and recommendation tasks by also drastically reducing their computational costs.","PeriodicalId":143584,"journal":{"name":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ASONAM.2014.6921646","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

Abstract

Nowadays, in the Web 2.0 reality, one of the most challenging task for companies that aim to manage and recommend job offers is to convey this enormous amount of information in a succinct and intelligent manner such to increase the performances of matching operations against users profiles/curricula and optimize the time/space complexity of these processes. With this goal, this paper presents a novel method to formalize the textual content of job offers that aims at identifying the most relevant information and fields expressed by them and leverage this compact formalization for job recommendation and profile matching in social network environments. This method has been then developed and tested in the industrial environment represented by Multiposting and Work4, world leaders in digital solutions of e-recruitment problems. In this study three classes of documents are considered: job offers, job categories and social network user profiles (as potential job candidates); each class contains several fields with textual information. The proposed representation method permits to dynamically identify those text fields, for each class, that could help a cross-matching strategy in order to preserve, from one hand, the matching/recommendation performances and, on the other hand, reduce the cost of these operations (due to a straightforward dimensionality reduction mechanism). We then evaluated and compared the presented approach showing significant improvements on both categorization and recommendation tasks by also drastically reducing their computational costs.
领域选择的工作分类和推荐给社会网络用户
如今,在Web 2.0现实中,对于旨在管理和推荐工作机会的公司来说,最具挑战性的任务之一是以简洁和智能的方式传达大量信息,从而提高针对用户配置文件/课程的匹配操作的性能,并优化这些过程的时间/空间复杂性。为此,本文提出了一种新的方法来形式化工作邀请的文本内容,旨在识别它们所表达的最相关的信息和领域,并利用这种紧凑的形式化来进行社交网络环境中的工作推荐和个人资料匹配。这种方法随后在以Multiposting和Work4为代表的工业环境中得到了发展和测试,这两家公司是电子招聘问题数字化解决方案的世界领导者。本研究考虑了三类文件:工作邀请、工作类别和社交网络用户档案(作为潜在的求职者);每个类包含几个带有文本信息的字段。所提出的表示方法允许动态识别每个类的文本字段,这有助于交叉匹配策略,以便一方面保持匹配/推荐性能,另一方面降低这些操作的成本(由于直接的降维机制)。然后,我们对所提出的方法进行了评估和比较,显示出在分类和推荐任务上的显著改进,同时也大大降低了它们的计算成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信