TY - GEN
T1 - A decision tree based quality control framework for multi-phase tasks in crowdsourcing
AU - Fang, Yili
AU - Chen, Pengpeng
AU - Sun, Kai
AU - Sun, Hailong
N1 - Publisher Copyright:
© 2017 Association for Computing Machinery.
PY - 2017/9/22
Y1 - 2017/9/22
N2 - In crowdsourcing, there exists an important category of tasks that comprise an ordered sequence of subtasks, which we refer to as Multi-phase Tasks (MPTs) - e.g. travel planning, translation and micro-writing. Existing result inference methods are ineffective for processing MPTs. The constrained relationships among phase-level subtasks of MPT cannot be ignored for two reasons. First, it is ineffective to conduct a MPT without phase-processing, e.g. for travel planning, recommending a complete route of travel planning, and using existing methods to infer the final result generated by an individual worker can hardly meet various requirements due to the lack of flexibility. Second, although a MPT consists of a set of phaselevel subtasks, it is unsuitable to simply split a MPT into subtasks and use top-k methods to recommend final results; because this will not only increase costs but also lose the constrained relationships among the phases. Thus it calls for a new approach to handle MPTs. This research first introduces the concept of MPT to identify these special tasks. Second, a decision tree based framework is provided to control task generation and final result combination in the crowdsourcing cooperative workflow for MPTs. Third, a probabilistic graphical model is proposed to characterize the subtasks of each MPT phase and a maximum likelihood based method is designed for result inference. Finally, extensive experiments were conducted based on real-world travel planning tasks and experimental results demonstrate the superiority of this approach in comparison with the state-of-the-art methods.
AB - In crowdsourcing, there exists an important category of tasks that comprise an ordered sequence of subtasks, which we refer to as Multi-phase Tasks (MPTs) - e.g. travel planning, translation and micro-writing. Existing result inference methods are ineffective for processing MPTs. The constrained relationships among phase-level subtasks of MPT cannot be ignored for two reasons. First, it is ineffective to conduct a MPT without phase-processing, e.g. for travel planning, recommending a complete route of travel planning, and using existing methods to infer the final result generated by an individual worker can hardly meet various requirements due to the lack of flexibility. Second, although a MPT consists of a set of phaselevel subtasks, it is unsuitable to simply split a MPT into subtasks and use top-k methods to recommend final results; because this will not only increase costs but also lose the constrained relationships among the phases. Thus it calls for a new approach to handle MPTs. This research first introduces the concept of MPT to identify these special tasks. Second, a decision tree based framework is provided to control task generation and final result combination in the crowdsourcing cooperative workflow for MPTs. Third, a probabilistic graphical model is proposed to characterize the subtasks of each MPT phase and a maximum likelihood based method is designed for result inference. Finally, extensive experiments were conducted based on real-world travel planning tasks and experimental results demonstrate the superiority of this approach in comparison with the state-of-the-art methods.
KW - Crowdsourcing
KW - Multiphase tasks
KW - Planning
KW - Quality control
KW - Result inference
UR - https://www.scopus.com/pages/publications/85033448781
U2 - 10.1145/3127404.3127408
DO - 10.1145/3127404.3127408
M3 - 会议稿件
AN - SCOPUS:85033448781
T3 - ACM International Conference Proceeding Series
SP - 10
EP - 17
BT - Proceedings - 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2017
PB - Association for Computing Machinery
T2 - 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2017
Y2 - 22 September 2017 through 23 September 2017
ER -