ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
An algorithm for automated rating of reviewers
Full text PdfPdf (140 KB)
Source International Conference on Digital Libraries archive
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries table of contents
Roanoke, Virginia, United States
Pages: 381 - 387  
Year of Publication: 2001
ISBN:1-58113-345-6
Authors
Tracy Riggs  Division of Computer Science, UC Berkeley, Berkeley, CA
Robert Wilensky  Division of Computer Science, UC Berkeley, Berkeley, CA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 57,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/379437.379731
What is a DOI?

Warning: The download time has expired please click on the item to try again.


ABSTRACT

The current system for scholarly information dissemination may be amen able to significant improvement. In particular, going from the current system of journal publication to one of self-distributed documents offers significant cost and timeliness advantages. A major concern with such alternatives is how to provide the value currently afforded by the peer review system.Here we propose a mechanism that could plausibly supply such value. In the peer review system, papers are judged meritorious if good reviewers give them good reviews. In its place, we propose a collaborative filtering algorithm which automatically rates reviewers, and incorporates the quality of the reviewer into the metric of merit for the paper. Such a system seems to provide all the benefits of the current peer review system, while at the same time being much more flexible.We have implemented a number of parameterized variations of this algorithm, and tested them on data available from a quite different application. Our initial experiments suggest that the algorithm is in fact ranking reviewers reasonably.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ACM-SIGIR 1999 Workshopon Recommender Systems: Algorithms and Evaluation. http://www.csee.umbc.edu/ian/sigir99- rec/summary.html.
 
2
The Berkeley Electronic Press. http://www.bepress.com/.
 
3
CiteSeer.http://citeseer.nj.nec.com.
 
4
Collaborative filtering. http://www.sims.ber eley.edu/resources/collab/.
 
5
The UC Berkeley Digital Library Project. http://elib.cs.berkeley.edu.
 
6
C.Avery, P. Resnick, and R. Zeckhauser. The Market for Evaluations. American Economic Review 89(3):564-584,1999.
7
 
8
J. Canny. Personal communication with the authors.
9
10
 
11
 
12
G. Z. A. Moukas and P. Maes. Collaborative Reputation Mechanisms in Electronic Mar etplaces. In Proceedings of the 32nd Hawaii International Conference on System Sciences 1999.
13
14
15
 
16
R. Smith. Opening up BMJ peer review. BMJ, 318:23-27, 1999.
 
17
C. Tenopir and D. W. King. Trends in scientific scholarly journal publishing in the United States. Journal of Scholarly Publishing 28:135-170, 1997.
18
 
19
H. R. Varian. The Future of Electronic Journals. Technology and Scholarly Communication 1999.


Collaborative Colleagues:
Tracy Riggs: colleagues
Robert Wilensky: colleagues