ACM Home Page
Please provide us with feedback. Feedback
Mining for proposal reviewers: lessons learned at the national science foundation
Full text PdfPdf (933 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Philadelphia, PA, USA
SESSION: Industrial and government applications track papers table of contents
Pages: 862 - 871  
Year of Publication: 2006
ISBN:1-59593-339-5
Authors
Seth Hettich  Google, Inc., Mountain View, CA
Michael J. Pazzani  Rutgers University, Piscataway, NJ
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 148,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1150402.1150521
What is a DOI?

ABSTRACT

In this paper, we discuss a prototype application deployed at the U.S. National Science Foundation for assisting program directors in identifying reviewers for proposals. The application helps program directors sort proposals into panels and find reviewers for proposals. To accomplish these tasks, it extracts information from the full text of proposals both to learn about the topics of proposals and the expertise of reviewers. We discuss a variety of alternatives that were explored, the solution that was implemented, and the experience in using the solution within the workflow of NSF.


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
2
 
3
Hopcroft, J., Khan, O., Kulis, B. & Selman, B. Tracking evolving communities in large linked networks. Proc. Natl Acad. Sci. USA 101(Suppl.1), 5249--5253
 
4
Bradley, P., Bennett, P and. Demiriz., A. (2000) Constrained k-means clustering. Technical report, MSR-TR-2000-6 5 Microsoft Research.
 
5
Banerjee, A. & Ghosh, J. (2002). Frequency Sensitive Competitive Learning for Clustering on High-dimensional Hypersphere, International Joint Conference on Neural Networks (IJCNN), pp. 1590--95.
6
 
7
8
 
9
van de Stadt, R. (2000). CyberChair, an Online Submission and Reviewing System or: A Program Chair's Best Friend, WWW9.
 
10
 
11
Porter, M. F., (1980), An algorithm for suffix stripping, Program, 14(3) :130--137
12
 
13
Rocchio, J. (1971) Relevance feedback in information retrieval, in. The SMART Retrieval System: Experiments in Automatic Document Processing. Prentice-Hall Inc., pg 313--323.
14
 
15
Basu, C., Hirsh, H., Cohen, W., and Nevill-Manning, C., (1999). Recommending Papers by Mining the Web, Proc. IJCAI Workshops on Learning About Users and Machine Learning for Information Filtering, IJCAI 99, Stockholm, Sweden.
 
16
Geller, J. and Scherl, R., 1997 Challenge: Technology for Automated Reviewer Selection, IJCAI 1997 55--61
17
18
19
20


Collaborative Colleagues:
Seth Hettich: colleagues
Michael J. Pazzani: colleagues