A New Approach for Computing the Matching Degree in the Paper-to-Reviewer Assignment Problem

Abdeldjaouad Nusayr Medakene, Khadra Bouanane, Mohammed Abdelhadi Eddoud
{"title":"A New Approach for Computing the Matching Degree in the Paper-to-Reviewer Assignment Problem","authors":"Abdeldjaouad Nusayr Medakene, Khadra Bouanane, Mohammed Abdelhadi Eddoud","doi":"10.1109/ICTAACS48474.2019.8988127","DOIUrl":null,"url":null,"abstract":"The Paper-to-Reviewer Assignment Problem is a prevalent and challenging problem within the scientific community and scientific conferences. The large number of reviewers and submitted papers, as well as constraints on reviewers’ loads and papers’ coverage needs, make difficult and very tedious for the committee chair to manually assign submitted papers to suitable reviewers. Any automation of this task must tackle three main issues: modeling reviewers’ and papers’ profiles, estimating the relevance between a paper and a reviewer and finally finding an appropriate assignment.In this paper, we are interested in the two first issues. We propose to build the reviewers profiles on the basis of both pedagogical and research documents, then a formula that takes into account both topics similarity and common references is proposed. Experimental results compared to ground-truth values extracted from ICA2IT’19 data show a good performance of this approach.","PeriodicalId":406766,"journal":{"name":"2019 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Theoretical and Applicative Aspects of Computer Science (ICTAACS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAACS48474.2019.8988127","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

The Paper-to-Reviewer Assignment Problem is a prevalent and challenging problem within the scientific community and scientific conferences. The large number of reviewers and submitted papers, as well as constraints on reviewers’ loads and papers’ coverage needs, make difficult and very tedious for the committee chair to manually assign submitted papers to suitable reviewers. Any automation of this task must tackle three main issues: modeling reviewers’ and papers’ profiles, estimating the relevance between a paper and a reviewer and finally finding an appropriate assignment.In this paper, we are interested in the two first issues. We propose to build the reviewers profiles on the basis of both pedagogical and research documents, then a formula that takes into account both topics similarity and common references is proposed. Experimental results compared to ground-truth values extracted from ICA2IT’19 data show a good performance of this approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论文-审稿人分配问题中匹配度计算的新方法
论文审稿人分配问题是科学界和科学会议中普遍存在的一个具有挑战性的问题。审稿人和提交的论文数量众多,以及审稿人工作量和论文覆盖范围的限制,使得委员会主席手动将提交的论文分配给合适的审稿人非常困难和繁琐。这项任务的任何自动化都必须解决三个主要问题:为审稿人和论文的概要建模,估计论文和审稿人之间的相关性,最后找到合适的任务。在本文中,我们对前两个问题感兴趣。我们建议在教学和研究文献的基础上建立审稿人档案,然后提出一个考虑主题相似性和共同参考文献的公式。实验结果与ICA2IT’19数据提取的真值进行了比较,表明了该方法的良好性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Suffix Tree Construction based Mapreduce Online Adversarial Planning in μRTS : A Survey A New Approach for Computing the Matching Degree in the Paper-to-Reviewer Assignment Problem Multi-criteria-based relay election for Data Dissemination in urban VANET A Framework for implementing the interoperability of semantic web services: Case study
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1