Improving accuracy and lowering cost in crowdsourcing through an unsupervised expertise estimation approach
作者:
Highlights:
• We introduce an unsupervised approach to expertise estimation in crowdsourcing named ROUX.
• We consider the problem of expertise estimation as a metaheuristic optimization search problem.
• We integrate it with a rough set to better estimate the expertise of each online worker.
• ROUX uses the expertise rating of workers for task assignment to maximize the result accuracy.
• Experimental evaluations using real-world datasets show that ROUX performs remarkably.
摘要
Crowdsourcing refers to distributing microtasks to an unknown group of online workers. Given that workers have varying expertise levels, a major research challenge for crowdsourcing is solving the problems of untargeted task assignment and unestimated aggregation of results. Although existing approaches can estimate the expertise of workers and use expertise information to allocate tasks, the effectiveness of these approaches is limited for the following reasons: 1) reliance on human intervention; 2) dependence on the type of answers; 3) non-sparseness; 4) post-expertise estimation. To overcome these limitations of crowdsourcing, this paper introduces an unsupervised approach to expertise estimation in microtask crowdsourcing that is independent of answer type, which is named ROUgh set based eXpertise estimation (ROUX). We consider the problem of expertise estimation as a metaheuristic optimization search problem, and integrate it with a rough set to better estimate the expertise of each online worker. Further, ROUX uses the expertise rating of workers for task assignment to maximize the accuracy of the results and lower the cost. Extensive experimental evaluations using real-world datasets show that ROUX performs remarkably in accuracy improvement and cost efficacy.
论文关键词:Crowdsourcing,Unsupervised expertise estimation,Harmony search,Rough set
论文评审过程:Received 18 December 2018, Revised 15 May 2019, Accepted 17 May 2019, Available online 22 May 2019, Version of Record 4 July 2019.
论文官网地址:https://doi.org/10.1016/j.dss.2019.05.005