Enhanced enterprise-student matching with meta-path based graph neural network

IF 5.2 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Fu Li , Guangsheng Ma , Feier Chen , Qiuyun Lyu , Zhen Wang , Jian Zhang
{"title":"Enhanced enterprise-student matching with meta-path based graph neural network","authors":"Fu Li ,&nbsp;Guangsheng Ma ,&nbsp;Feier Chen ,&nbsp;Qiuyun Lyu ,&nbsp;Zhen Wang ,&nbsp;Jian Zhang","doi":"10.1016/j.jksuci.2024.102116","DOIUrl":null,"url":null,"abstract":"<div><p>Job-seeking is always an inescapable challenge for graduates. It may take a lot of time to find satisfying jobs due to the information gap between students who need satisfying offers and enterprises which ask for proper candidates. Although campus recruiting and job advertisements on the Internet could provide partial information, it is still not enough to help students and enterprises know each other and effectively match a graduate with a job. To narrow the information gap, we propose to recommend jobs for graduates based on historical employment data. Specifically, we construct a heterogeneous information network to characterize the relations between <em>students</em>, <em>enterprises</em> and <em>industries</em>. And then, we propose a meta-path based graph neural network, namely GraphRecruit, to further learn both latent student and enterprise portrait representations. The designed meta-paths connect students with their preferred enterprises and industries from different aspects. Also, we apply genetic algorithm optimization for meta-path selection according to application scenarios to enhance recommendation suitability and accuracy. To show the effectiveness of GraphRecruit, we collect five-year employment data and conduct extensive experiments comparing GraphRecruit with 4 classical baselines. The results demonstrate the superior performance of the proposed method.</p></div>","PeriodicalId":48547,"journal":{"name":"Journal of King Saud University-Computer and Information Sciences","volume":null,"pages":null},"PeriodicalIF":5.2000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1319157824002052/pdfft?md5=b92e9095dd2f3d188041171d9ee66fb2&pid=1-s2.0-S1319157824002052-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of King Saud University-Computer and Information Sciences","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1319157824002052","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Job-seeking is always an inescapable challenge for graduates. It may take a lot of time to find satisfying jobs due to the information gap between students who need satisfying offers and enterprises which ask for proper candidates. Although campus recruiting and job advertisements on the Internet could provide partial information, it is still not enough to help students and enterprises know each other and effectively match a graduate with a job. To narrow the information gap, we propose to recommend jobs for graduates based on historical employment data. Specifically, we construct a heterogeneous information network to characterize the relations between students, enterprises and industries. And then, we propose a meta-path based graph neural network, namely GraphRecruit, to further learn both latent student and enterprise portrait representations. The designed meta-paths connect students with their preferred enterprises and industries from different aspects. Also, we apply genetic algorithm optimization for meta-path selection according to application scenarios to enhance recommendation suitability and accuracy. To show the effectiveness of GraphRecruit, we collect five-year employment data and conduct extensive experiments comparing GraphRecruit with 4 classical baselines. The results demonstrate the superior performance of the proposed method.

利用基于元路径的图神经网络增强企业与学生的匹配度
求职始终是毕业生无法回避的挑战。学生需要满意的工作,企业需要合适的人选,由于信息不对等,学生可能需要花费大量时间才能找到满意的工作。虽然校园招聘和互联网上的招聘广告可以提供部分信息,但仍不足以帮助学生和企业相互了解并有效地为毕业生匹配工作。为了缩小信息差距,我们建议根据历史就业数据为毕业生推荐工作。具体来说,我们构建了一个异构信息网络来描述学生、企业和行业之间的关系。然后,我们提出了一种基于元路径的图神经网络,即 GraphRecruit,以进一步学习潜在的学生和企业肖像表征。所设计的元路径从不同方面将学生与他们喜欢的企业和行业联系起来。此外,我们还根据应用场景应用遗传算法优化元路径选择,以提高推荐的适宜性和准确性。为了证明 GraphRecruit 的有效性,我们收集了五年的就业数据,并进行了大量实验,将 GraphRecruit 与 4 个经典基线进行比较。实验结果证明了所提出方法的卓越性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
10.50
自引率
8.70%
发文量
656
审稿时长
29 days
期刊介绍: In 2022 the Journal of King Saud University - Computer and Information Sciences will become an author paid open access journal. Authors who submit their manuscript after October 31st 2021 will be asked to pay an Article Processing Charge (APC) after acceptance of their paper to make their work immediately, permanently, and freely accessible to all. The Journal of King Saud University Computer and Information Sciences is a refereed, international journal that covers all aspects of both foundations of computer and its practical applications.
×
引用
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学术官方微信