arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1806.00637cs.DB
收藏

众包中保证质量的同步任务分配

Quality-Assured Synchronized Task Assignment in Crowdsourcing

Jiayang Tu, Peng Cheng, Lei Chen

摘要:

随着聚集互联网工作者智慧的众包平台的快速发展,众包已被广泛用于解决需要人类认知能力的问题。考虑到工人到达和离开的动态性,设计一个任务分配方案来自适应地为可用工人选择最有益的任务是至关重要的。在本文中,为了最有效地利用工人的劳动力和平衡的答案的准确性和整体延迟,我们a)开发一个参数估计模型,帮助估计工人的专业知识,问题的容易程度和答案的信心; b)提出了一个\textit{quality-assured synchronized task assignment scheme},分批执行,并最大限度地提高潜在完成的问题(MCQ)的数量在每个批次。我们证明了MCQ问题是NP-困难的,并给出了两个贪婪近似解来解决这个问题。通过在合成数据集和真实数据集上的大量实验,进一步评估了近似解的有效性和效率。实验结果表明,在同步任务分配场景中,MCQ方法的准确性和总体延迟优于现有的在线任务分配算法。

英文摘要:

With the rapid development of crowdsourcing platforms that aggregate the intelligence of Internet workers, crowdsourcing has been widely utilized to address problems that require human cognitive abilities. Considering great dynamics of worker arrival and departure, it is of vital importance to design a task assignment scheme to adaptively select the most beneficial tasks for the available workers. In this paper, in order to make the most efficient utilization of the worker labor and balance the accuracy of answers and the overall latency, we a) develop a parameter estimation model that assists in estimating worker expertise, question easiness and answer confidence; b) propose a \textit{quality-assured synchronized task assignment scheme} that executes in batches and maximizes the number of potentially completed questions (MCQ) within each batch. We prove that MCQ problem is NP-hard and present two greedy approximation solutions to address the problem. The effectiveness and efficiency of the approximation solutions are further evaluated through extensive experiments on synthetic and real datasets. The experimental results show that the accuracy and the overall latency of the MCQ approaches outperform the existing online task assignment algorithms in the synchronized task assignment scenario.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑