arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.11722cs.HCcs.SI
收藏

CrowDC:众包中配对比较的分治方法

CrowDC: A Divide-and-Conquer Approach for Paired Comparisons in Crowdsourcing

Ming-Hung Wang, Chia-Yuan Zhang, Jia-Ru Song

摘要:

基于主观性对一组样本进行排名,例如流媒体视频的体验质量或图像的幸福感,一直是典型的众包任务。许多研究采用配对比较分析来解决挑战,因为它通过允许参与者选择单一解决方案来减少参与者的工作量。尽管如此,为了彻底比较所有目标组合,任务的数量呈二次方增加。本文提出了一种分而治之的配对比较算法--CrowDC。仿真结果表明,当排序超过100个项目时,CrowDC可以减少40-50%的任务数量,同时保持90-95%的准确率。

英文摘要:

Ranking a set of samples based on subjectivity, such as the experience quality of streaming video or the happiness of images, has been a typical crowdsourcing task. Numerous studies have employed paired comparison analysis to solve challenges since it reduces the workload for participants by allowing them to select a single solution. Nonetheless, to thoroughly compare all target combinations, the number of tasks increases quadratically. This paper presents ``CrowDC'', a divide-and-conquer algorithm for paired comparisons. Simulation results show that when ranking more than 100 items, CrowDC can reduce 40-50% in the number of tasks while maintaining 90-95% accuracy compared to the baseline approach.

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

↑