Published in

Proceedings of the 2013 workshop on Computational scientometrics: theory & applications - CompSci '13

DOI: 10.1145/2508497.2508498

Links

Tools

Export citation

Search in Google Scholar

Recommending program committee candidates for academic conferences

Proceedings article published in 2013 by Shuguang Han, Jiepu Jiang, Zhen Yue, Daqing He ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

Establishing a respectful and well-functional program committee (PC) consisting of capable PC members is one of the most important tasks for conference organizers. However, little research has been done for automatic recommendation of PC candidates. PC member finding is a complex task, which could be influenced by many factors such as the candidates' research interests' match with conference topics, the candidates' social closeness with PC chairs, the candidates' authoritativeness, as well as the candidates' publication history in the conference. To examine the importance of each feature, we build a dataset that consists of papers from four conferences: KDD, SIGIR, JCDL and GIS (2007-2011) and split it into the training and testing subsets based on the temporal information. The results show that: i) the publication history is the strongest indicator of being PC members; ii) recommendations based on the social closeness also produce reasonable good results; iii) recommend high authority researchers as PC members fails to predict the real PC because there are a large proportion of PC members who actually only have low authority values (we use the PageRank value in coauthor networks to simulate researcher's authority); and iv) applying simple linear combination of different features can make reasonable improvements.