Efficient Worker Selection Through History-based Learning in Crowdsourcing
Affiliation auteurs | !!!! Error affiliation !!!! |
Titre | Efficient Worker Selection Through History-based Learning in Crowdsourcing |
Type de publication | Conference Paper |
Year of Publication | 2017 |
Auteurs | Awwad T, Bennani N, Ziegler K, Sonigo V, Brunie L, Kosch H |
Editor | Reisman S, Ahamed SI, Demartini C, Conte T, Liu L, Claycomb W, Nakamura M, Tovar E, Cimato S, Lung CH, Takakura H, Yang JJ, Akiyama T, Zhang Z, Hasan K |
Conference Name | 2017 IEEE 41ST ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COMPSAC), VOL 1 |
Publisher | IEEE; IEEE Comp Soc |
Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
ISBN Number | 978-1-5386-0367-3 |
Mots-clés | Cost reduction, Crowdsourcing, Offline learning, Task clustering, Worker selection |
Résumé | Crowdsourcing has emerged as a promising approach for obtaining services and data in a short time and at a reasonable budget. However, the quality of the output provided by the crowd is not guaranteed, and must be controlled. This quality control usually relies on worker screening or contribution reviewing at the cost of additional time and budget overheads. In this paper, we propose to reduce these overheads by leveraging the system history. We describe an offline learning algorithm that groups tasks from history into homogeneous clusters and learns for each cluster the worker features that optimize the contribution quality. These features are then used by the online targeting algorithm to select reliable workers for each incoming task. The proposed method is compared to the state of the art selection methods using real world datasets. Results show that we achieve comparable, and in some cases better, output quality for a smaller budget and shorter time. |
DOI | 10.1109/COMPSAC.2017.275 |