TY - GEN
T1 - Crowdsourcing high quality labels with a tight budget
AU - Li, Qi
AU - Ma, Fenglong
AU - Gao, Jing
AU - Su, Lu
AU - Quinn, Christopher J.
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/2/8
Y1 - 2016/2/8
N2 - In the past decade, commercial crowdsourcing platforms have revolutionized the ways of classifying and annotating data, especially for large datasets. Obtaining labels for a single instance can be inexpensive, but for large datasets, it is important to allocate budgets wisely. With limited budgets, requesters must trade-off between the quantity of labeled instances and the quality of the final results. Existing budget allocation methods can achieve good quantity but cannot guarantee high quality of individual instances under a tight budget. However, in some scenarios, requesters may be willing to label fewer instances but of higher quality. Moreover, they may have different requirements on quality for different tasks. To address these challenges, we propose a flexible budget allocation framework called Requallo. Requallo allows requesters to set their specific requirements on the labeling quality and maximizes the number of labeled instances that achieve the quality requirement under a tight budget. The budget allocation problem is modeled as a Markov decision process and a sequential labeling policy is produced. The proposed policy greedily searches for the instance to query next as the one that can provide the maximum reward for the goal. The Requallo framework is further extended to consider worker reliability so that the budget can be better allocated. Experiments on two real-world crowdsourcing tasks as well as a simulated task demonstrate that when the budget is tight, the proposed Requallo framework outperforms existing state-of-the-art budget allocation methods from both quantity and quality aspects.
AB - In the past decade, commercial crowdsourcing platforms have revolutionized the ways of classifying and annotating data, especially for large datasets. Obtaining labels for a single instance can be inexpensive, but for large datasets, it is important to allocate budgets wisely. With limited budgets, requesters must trade-off between the quantity of labeled instances and the quality of the final results. Existing budget allocation methods can achieve good quantity but cannot guarantee high quality of individual instances under a tight budget. However, in some scenarios, requesters may be willing to label fewer instances but of higher quality. Moreover, they may have different requirements on quality for different tasks. To address these challenges, we propose a flexible budget allocation framework called Requallo. Requallo allows requesters to set their specific requirements on the labeling quality and maximizes the number of labeled instances that achieve the quality requirement under a tight budget. The budget allocation problem is modeled as a Markov decision process and a sequential labeling policy is produced. The proposed policy greedily searches for the instance to query next as the one that can provide the maximum reward for the goal. The Requallo framework is further extended to consider worker reliability so that the budget can be better allocated. Experiments on two real-world crowdsourcing tasks as well as a simulated task demonstrate that when the budget is tight, the proposed Requallo framework outperforms existing state-of-the-art budget allocation methods from both quantity and quality aspects.
UR - http://www.scopus.com/inward/record.url?scp=84964378377&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84964378377&partnerID=8YFLogxK
U2 - 10.1145/2835776.2835797
DO - 10.1145/2835776.2835797
M3 - Conference contribution
AN - SCOPUS:84964378377
T3 - WSDM 2016 - Proceedings of the 9th ACM International Conference on Web Search and Data Mining
SP - 237
EP - 246
BT - WSDM 2016 - Proceedings of the 9th ACM International Conference on Web Search and Data Mining
PB - Association for Computing Machinery, Inc
T2 - 9th ACM International Conference on Web Search and Data Mining, WSDM 2016
Y2 - 22 February 2016 through 25 February 2016
ER -