An integer linear programming model of reviewer assignment with research interest considerations

In the regular work process of peer review, editors have to read and understand the entire set of submissions to choose appropriate reviewers. However, due to a large number of submissions, to select reviewers manually becomes error-prone and time-consuming. In this research, a framework that consid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research 2020-08, Vol.291 (1-2), p.409-433
Hauptverfasser: Jin, Jian, Niu, Baozhuang, Ji, Ping, Geng, Qian
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 433
container_issue 1-2
container_start_page 409
container_title Annals of operations research
container_volume 291
creator Jin, Jian
Niu, Baozhuang
Ji, Ping
Geng, Qian
description In the regular work process of peer review, editors have to read and understand the entire set of submissions to choose appropriate reviewers. However, due to a large number of submissions, to select reviewers manually becomes error-prone and time-consuming. In this research, a framework that considers different indispensable aspects such as topical relevance, topical authority and research interest is presented and, an integer linear programming problem is formulated with practical considerations to recommend reviewers for a group of submissions. Specifically, the topical relevance and the topical authority are utilized to recommend relevant and accredited candidates in submission-related topics, while the research interest is to exam the willingness of candidates to review a submission. To evaluate the effectiveness of the proposed approach, categories of comparative experiments were conducted on two large scholarly datasets. Experimental results demonstrate that, compared with benchmark approaches, the proposed approach is capable to capture the research interest of reviewer candidates without a significant loss in different evaluation metrics. Our work can be helpful for editors to invite matching experts in peer review and highlight the necessity to uncover valuable information from big scholarly data for expert selection.
doi_str_mv 10.1007/s10479-018-2919-7
format Article
fullrecord <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2049750966</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A630101114</galeid><sourcerecordid>A630101114</sourcerecordid><originalsourceid>FETCH-LOGICAL-c420t-375eba08073772d8536b1c55837b7d4251a686f8873c76cd71e901ab0b0ba6ad3</originalsourceid><addsrcrecordid>eNp1kctOwzAQRS0EEqXwAewisSVlHMexs6wqXlIlNrA2juOkrhqn2CkVf8-UIkEl0Cz8Onc8M5eQSwoTCiBuIoVclClQmWYlLVNxREaUiywtGZPHZAQZz1POGJySsxiXAECp5CPyOvWJ84NtbUhWzlsdknXo26C7zvk26frarpK-SYJ9d3aLkI7Rtb6zfki2bljgQ0SRWXxlwcOQmN5HV9ugB4e7c3LS6FW0F9_rmLzc3T7PHtL50_3jbDpPTZ7BkDLBbaVBgmBCZLXkrKio4VwyUYk6zzjVhSwaKQUzojC1oLYEqivA0IWu2Zhc7fNi-W8brEMt-03w-KXKIC8Fh7IofqhWr6xyvumHoE3nolHTggHFqdAcqckfFEZtO4ft2cbh_YHg-peg2kScJM4J59AuhtjqTYyHON3jJvQxBtuodXCdDh-KgtrZqfZ2KrRT7exUAjXZXhOR9WjXT3__iz4BpC6hWQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2049750966</pqid></control><display><type>article</type><title>An integer linear programming model of reviewer assignment with research interest considerations</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Jin, Jian ; Niu, Baozhuang ; Ji, Ping ; Geng, Qian</creator><creatorcontrib>Jin, Jian ; Niu, Baozhuang ; Ji, Ping ; Geng, Qian</creatorcontrib><description>In the regular work process of peer review, editors have to read and understand the entire set of submissions to choose appropriate reviewers. However, due to a large number of submissions, to select reviewers manually becomes error-prone and time-consuming. In this research, a framework that considers different indispensable aspects such as topical relevance, topical authority and research interest is presented and, an integer linear programming problem is formulated with practical considerations to recommend reviewers for a group of submissions. Specifically, the topical relevance and the topical authority are utilized to recommend relevant and accredited candidates in submission-related topics, while the research interest is to exam the willingness of candidates to review a submission. To evaluate the effectiveness of the proposed approach, categories of comparative experiments were conducted on two large scholarly datasets. Experimental results demonstrate that, compared with benchmark approaches, the proposed approach is capable to capture the research interest of reviewer candidates without a significant loss in different evaluation metrics. Our work can be helpful for editors to invite matching experts in peer review and highlight the necessity to uncover valuable information from big scholarly data for expert selection.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-018-2919-7</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Analysis ; Big data ; Business and Management ; Combinatorics ; Decision support systems ; Integer programming ; Linear programming ; Methods ; Operations research ; Operations Research/Decision Theory ; Peer review ; S.I.: RealCaseOR ; Scholarly publishing ; Studies ; Theory of Computation</subject><ispartof>Annals of operations research, 2020-08, Vol.291 (1-2), p.409-433</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018</rights><rights>COPYRIGHT 2020 Springer</rights><rights>Springer Science+Business Media, LLC, part of Springer Nature 2018.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c420t-375eba08073772d8536b1c55837b7d4251a686f8873c76cd71e901ab0b0ba6ad3</citedby><cites>FETCH-LOGICAL-c420t-375eba08073772d8536b1c55837b7d4251a686f8873c76cd71e901ab0b0ba6ad3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10479-018-2919-7$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-018-2919-7$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Jin, Jian</creatorcontrib><creatorcontrib>Niu, Baozhuang</creatorcontrib><creatorcontrib>Ji, Ping</creatorcontrib><creatorcontrib>Geng, Qian</creatorcontrib><title>An integer linear programming model of reviewer assignment with research interest considerations</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>In the regular work process of peer review, editors have to read and understand the entire set of submissions to choose appropriate reviewers. However, due to a large number of submissions, to select reviewers manually becomes error-prone and time-consuming. In this research, a framework that considers different indispensable aspects such as topical relevance, topical authority and research interest is presented and, an integer linear programming problem is formulated with practical considerations to recommend reviewers for a group of submissions. Specifically, the topical relevance and the topical authority are utilized to recommend relevant and accredited candidates in submission-related topics, while the research interest is to exam the willingness of candidates to review a submission. To evaluate the effectiveness of the proposed approach, categories of comparative experiments were conducted on two large scholarly datasets. Experimental results demonstrate that, compared with benchmark approaches, the proposed approach is capable to capture the research interest of reviewer candidates without a significant loss in different evaluation metrics. Our work can be helpful for editors to invite matching experts in peer review and highlight the necessity to uncover valuable information from big scholarly data for expert selection.</description><subject>Analysis</subject><subject>Big data</subject><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Decision support systems</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Methods</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Peer review</subject><subject>S.I.: RealCaseOR</subject><subject>Scholarly publishing</subject><subject>Studies</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kctOwzAQRS0EEqXwAewisSVlHMexs6wqXlIlNrA2juOkrhqn2CkVf8-UIkEl0Cz8Onc8M5eQSwoTCiBuIoVclClQmWYlLVNxREaUiywtGZPHZAQZz1POGJySsxiXAECp5CPyOvWJ84NtbUhWzlsdknXo26C7zvk26frarpK-SYJ9d3aLkI7Rtb6zfki2bljgQ0SRWXxlwcOQmN5HV9ugB4e7c3LS6FW0F9_rmLzc3T7PHtL50_3jbDpPTZ7BkDLBbaVBgmBCZLXkrKio4VwyUYk6zzjVhSwaKQUzojC1oLYEqivA0IWu2Zhc7fNi-W8brEMt-03w-KXKIC8Fh7IofqhWr6xyvumHoE3nolHTggHFqdAcqckfFEZtO4ft2cbh_YHg-peg2kScJM4J59AuhtjqTYyHON3jJvQxBtuodXCdDh-KgtrZqfZ2KrRT7exUAjXZXhOR9WjXT3__iz4BpC6hWQ</recordid><startdate>20200801</startdate><enddate>20200801</enddate><creator>Jin, Jian</creator><creator>Niu, Baozhuang</creator><creator>Ji, Ping</creator><creator>Geng, Qian</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20200801</creationdate><title>An integer linear programming model of reviewer assignment with research interest considerations</title><author>Jin, Jian ; Niu, Baozhuang ; Ji, Ping ; Geng, Qian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c420t-375eba08073772d8536b1c55837b7d4251a686f8873c76cd71e901ab0b0ba6ad3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Analysis</topic><topic>Big data</topic><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Decision support systems</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Methods</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Peer review</topic><topic>S.I.: RealCaseOR</topic><topic>Scholarly publishing</topic><topic>Studies</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jin, Jian</creatorcontrib><creatorcontrib>Niu, Baozhuang</creatorcontrib><creatorcontrib>Ji, Ping</creatorcontrib><creatorcontrib>Geng, Qian</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jin, Jian</au><au>Niu, Baozhuang</au><au>Ji, Ping</au><au>Geng, Qian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An integer linear programming model of reviewer assignment with research interest considerations</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2020-08-01</date><risdate>2020</risdate><volume>291</volume><issue>1-2</issue><spage>409</spage><epage>433</epage><pages>409-433</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>In the regular work process of peer review, editors have to read and understand the entire set of submissions to choose appropriate reviewers. However, due to a large number of submissions, to select reviewers manually becomes error-prone and time-consuming. In this research, a framework that considers different indispensable aspects such as topical relevance, topical authority and research interest is presented and, an integer linear programming problem is formulated with practical considerations to recommend reviewers for a group of submissions. Specifically, the topical relevance and the topical authority are utilized to recommend relevant and accredited candidates in submission-related topics, while the research interest is to exam the willingness of candidates to review a submission. To evaluate the effectiveness of the proposed approach, categories of comparative experiments were conducted on two large scholarly datasets. Experimental results demonstrate that, compared with benchmark approaches, the proposed approach is capable to capture the research interest of reviewer candidates without a significant loss in different evaluation metrics. Our work can be helpful for editors to invite matching experts in peer review and highlight the necessity to uncover valuable information from big scholarly data for expert selection.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-018-2919-7</doi><tpages>25</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0254-5330
ispartof Annals of operations research, 2020-08, Vol.291 (1-2), p.409-433
issn 0254-5330
1572-9338
language eng
recordid cdi_proquest_journals_2049750966
source Business Source Complete; SpringerLink Journals - AutoHoldings
subjects Analysis
Big data
Business and Management
Combinatorics
Decision support systems
Integer programming
Linear programming
Methods
Operations research
Operations Research/Decision Theory
Peer review
S.I.: RealCaseOR
Scholarly publishing
Studies
Theory of Computation
title An integer linear programming model of reviewer assignment with research interest considerations
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T21%3A47%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20integer%20linear%20programming%20model%20of%20reviewer%20assignment%20with%20research%20interest%20considerations&rft.jtitle=Annals%20of%20operations%20research&rft.au=Jin,%20Jian&rft.date=2020-08-01&rft.volume=291&rft.issue=1-2&rft.spage=409&rft.epage=433&rft.pages=409-433&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-018-2919-7&rft_dat=%3Cgale_proqu%3EA630101114%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2049750966&rft_id=info:pmid/&rft_galeid=A630101114&rfr_iscdi=true