TY - GEN
T1 - Effective solution for labeling candidates with a proper ration for efficient crowdsourcing
AU - Chen, Zhao
AU - Cheng, Peng
AU - Zhang, Chen
AU - Chen, Lei
N1 - Publisher Copyright:
© Springer International Publishing AG, part of Springer Nature 2018.
PY - 2018/5
Y1 - 2018/5
N2 - One of the core problems of crowdsourcing research is how to reduce the cost, in other words, how to get better results with a limited budget. To save budget, most researchers concentrate on internal steps of crowdsourcing while in this work we focus on the pre-processing stage: how to select the input for crowds to contribute. A straightforward application of this work is to help budget-limited machine learning researchers to get better balanced training data from crowd labeling. Specifically, we formulate the prior information based input manipulating procedure as the Candidate Selection Problem (CSP) and propose an end-squeezing algorithm for it. Our results show that a considerable cost reduction can be achieved by manipulating the input to the crowd with the help of some additional prior information. We verify the effectiveness and efficiency of these algorithms through extensive experiments.
AB - One of the core problems of crowdsourcing research is how to reduce the cost, in other words, how to get better results with a limited budget. To save budget, most researchers concentrate on internal steps of crowdsourcing while in this work we focus on the pre-processing stage: how to select the input for crowds to contribute. A straightforward application of this work is to help budget-limited machine learning researchers to get better balanced training data from crowd labeling. Specifically, we formulate the prior information based input manipulating procedure as the Candidate Selection Problem (CSP) and propose an end-squeezing algorithm for it. Our results show that a considerable cost reduction can be achieved by manipulating the input to the crowd with the help of some additional prior information. We verify the effectiveness and efficiency of these algorithms through extensive experiments.
UR - https://www.scopus.com/pages/publications/85048965674
U2 - 10.1007/978-3-319-91458-9_23
DO - 10.1007/978-3-319-91458-9_23
M3 - Conference article published in proceeding or book
AN - SCOPUS:85048965674
SN - 9783319914572
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 386
EP - 394
BT - Database Systems for Advanced Applications - 23rd International Conference, DASFAA 2018, Proceedings
A2 - Pei, Jian
A2 - Sadiq, Shazia
A2 - Li, Jianxin
A2 - Manolopoulos, Yannis
PB - Springer Verlag
T2 - 23rd International Conference on Database Systems for Advanced Applications, DASFAA 2018
Y2 - 21 May 2018 through 24 May 2018
ER -