检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:钟磊 周允升 余敦辉 崔海波[1,2] ZHONG Lei;ZHOU Yunsheng;YU Dunhui;CUI Haibo(School of Computer Science and Information Engineering,Hubei University,Wuhan Hubei 430062,China;Hubei Engineering Technology Research Center of Educational Informatization(Hubei University),Wuhan Hubei 430062,China)
机构地区:[1]湖北大学计算机与信息工程学院,武汉430062 [2]湖北省教育信息化工程技术研究中心(湖北大学),武汉430062
出 处:《计算机应用》2023年第2期430-436,共7页journal of Computer Applications
基 金:国家自然科学基金资助项目(61977021,61832014);湖北省技术创新专项(重大项目)(2020AEA008)。
摘 要:针对现有审稿人推荐算法主要通过亲和力分数分配审稿人,而忽略了审稿人与论文研究方向匹配的问题,提出一种基于亲和力与研究方向覆盖率的审稿人推荐算法(ARDC)。首先,根据研究方向在待审论文和审稿人论文组中出现的频数,确定论文选择审稿人的次序;然后,综合审稿人和论文间的亲和力得分以及审稿人对论文的研究方向覆盖得分,来计算审稿人对待审论文的综合审阅得分,并依据轮询调度得到论文预分配审稿小组;最后,对预分配审稿小组进行利益冲突检查与消解以实现最终的审稿小组推荐。实验结果表明,与基于松弛迭代的分配算法(FairIR)和同行评审公平分配算法(PR4A)等基于分配的审稿人推荐算法相比,所提算法在牺牲少量亲和力的情况下,将研究方向覆盖得分平均提高了38%,从而确保推荐结果更加准确合理。To deal with the problem that the existing reviewer recommendation algorithms assign reviewers only through affinity score and ignore the research direction matching between reviewers and papers to be reviewed,a reviewer recommendation algorithm based on Affinity and Research Direction Coverage(ARDC)was proposed.Firstly,the order of the paper’s selection of reviewers was determined according to the frequencies of the research directions appearing in the papers and the reviewer’s paper groups.Secondly,the reviewer’s comprehensive review score to the paper to be reviewed was calculated based on the affinity score between the reviewers and the paper to be reviewed and the research direction coverage score of the reviewers to the paper to be reviewed,and the pre-assigned review team for the paper was obtained on the basis of round-robin scheduling.Finally,the final recommendation of the review team was realized based on the conflict of interest conflict inspection and resolution.Experimental results show that compared with assignment based reviewer recommendation algorithms such as Fair matching via Iterative Relaxation(FairIR)and Fair and Accurate reviewer assignment in Peer Review(PR4A),the proposed algorithm has the average research direction coverage score increased by 38% on average at the expense of a small amount of affinity score,so that the recommendation result is more accurate and reasonable.
关 键 词:审稿人推荐 亲和力分数 主题模型 利益冲突 轮询调度
分 类 号:TP391.3[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.16