Proceedings of the 8th ACM Conference on Recommender Systems 2014
DOI: 10.1145/2645710.2645749
|View full text |Cite
|
Sign up to set email alerts
|

A robust model for paper reviewer assignment

Abstract: Automatic expert assignment is a common problem encountered in both industry and academia. For example, for conference program chairs and journal editors, in order to collect "good" judgments for a paper, it is necessary for them to assign the paper to the most appropriate reviewers. Choosing appropriate reviewers of course includes a number of considerations such as expertise and authority, but also diversity and avoiding conflicts. In this paper, we explore the expert retrieval problem and implement an autom… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
63
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 65 publications
(63 citation statements)
references
References 20 publications
0
63
0
Order By: Relevance
“…Bootstrapping can be done using traditional similarity measures. Liu et al (2014) proposes a model using Random Walk with Restart to traverse the graph of potential reviewers. The information on authority, expertise and diversity are used to build this network.…”
Section: Reviewer Assignment Problemmentioning
confidence: 99%
“…Bootstrapping can be done using traditional similarity measures. Liu et al (2014) proposes a model using Random Walk with Restart to traverse the graph of potential reviewers. The information on authority, expertise and diversity are used to build this network.…”
Section: Reviewer Assignment Problemmentioning
confidence: 99%
“…Firstly, the retrieval-based approaches, such as latent semantic index (LSI) [39], topic model [4,31,36], etc., mainly focus on the topic relationship between papers and reviewer candidates. Besides, these methods have considered many types of constraints, such as authority, diversity, expertise, availability [18,24,26,41] and the research interests [17] of reviewers. Secondly, the matching-based approaches often compute a matching based on a bipartite graph between papers and reviewer candidates [5,6].…”
Section: Introductionmentioning
confidence: 99%
“…Without real-time matching, for example, if one waits to match people to teams offline (e.g., by collecting a pool of people before assigning teams), then team starvation or worker retention issues arise where teams may sit dormant without progress or workers may leave while you wait to assign people to the teams. The problem of real-time diverse matching arises in many disciplines and problems, including: matching workers to firms [5], children to schools [6,7], reviewers to manuscripts [8,9], donor organs to patients [10,11] and residents to public housing [12]. Specifically, this paper contributes to the following:…”
Section: Introductionmentioning
confidence: 99%