DocumentCode
721305
Title
Automated Fair Paper Reviewer Assignment for Conference Management System
Author
Kale, Akash ; Kharat, Reena ; Bodkhe, Sourabh ; Apte, Prathmesh ; Dhonde, Himanshu
Author_Institution
Dept. of Comput. Eng., Savitribai Phule Pune Univ., Pune, India
fYear
2015
fDate
26-27 Feb. 2015
Firstpage
408
Lastpage
411
Abstract
Common practice observed in a conference for judging the submitted papers is peer review. The most important task which is involved in peer review is assigning the submitted papers to reviewers with good domain knowledge. In this paper, we have used maximum topic coverage while assigning paper to reviewer and degree of freshness of reviewer. This results in a solution to the paper reviewer assignment problem with relaxed paper demand constraint and reviewer workload constraint. The problem goes into NP-Hard if the constraints mentioned above are not relaxed. We have tried to relax those constraints and bring our problem down to NP. The use of expertise degree can be seen in this paper, this helps us in finding the most relevant expert of a particular domain.
Keywords
computational complexity; NP-hard problem; automated fair paper reviewer assignment; conference management system; maximum topic coverage; peer review; relaxed paper demand constraint; reviewer workload constraint; Algorithm design and analysis; Bibliometrics; Computer science; Heuristic algorithms; Sorting; Time complexity; Writing; Assignment; Expertise; Freshness; MAX TC-PRA; Matching; NP-Hard; Paper; Quality; Reviewer; Topic;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing Communication Control and Automation (ICCUBEA), 2015 International Conference on
Conference_Location
Pune
Type
conf
DOI
10.1109/ICCUBEA.2015.85
Filename
7155878
Link To Document