众包合并:通过后续合并实现最优众包质量管理

Yinan Zhang, Li-zhen Cui, Jiwei Huang, C. Miao
{"title":"众包合并:通过后续合并实现最优众包质量管理","authors":"Yinan Zhang, Li-zhen Cui, Jiwei Huang, C. Miao","doi":"10.1145/3265689.3265714","DOIUrl":null,"url":null,"abstract":"Quality management of worker responses is an increasingly important issue in crowdsourcing, which can be a fundamental reference for workload allocation. However, most of the existing solutions to worker response evaluation meet with significant challenges. Part of them are only able to obtain locally optimal results with low accuracy, while the others have to pay a high price to achieve global optimality. In order to tackle these challenges, this paper proposes a solution to worker quality management which is able to obtain optimal evaluation results close to the globally one with acceptable computational overhead. It is proved to be globally optimal results under certain conditions. The basic idea of the approach is to calculate the similarities among the workers according to which the workers can be clustered gradually. The unknown answers (or outputs) of the tasks are predicted from the results obtained by the clustered workers which will further help with the similarity calculation and the clustering among the remaining workers. A framework and detailed schemes are presented, and simulation experiments are conducted to validate the efficacy of the approach.","PeriodicalId":370356,"journal":{"name":"International Conference on Crowd Science and Engineering","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"CrowdMerge: Achieving Optimal Crowdsourcing Quality Management by Sequent Merger\",\"authors\":\"Yinan Zhang, Li-zhen Cui, Jiwei Huang, C. Miao\",\"doi\":\"10.1145/3265689.3265714\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quality management of worker responses is an increasingly important issue in crowdsourcing, which can be a fundamental reference for workload allocation. However, most of the existing solutions to worker response evaluation meet with significant challenges. Part of them are only able to obtain locally optimal results with low accuracy, while the others have to pay a high price to achieve global optimality. In order to tackle these challenges, this paper proposes a solution to worker quality management which is able to obtain optimal evaluation results close to the globally one with acceptable computational overhead. It is proved to be globally optimal results under certain conditions. The basic idea of the approach is to calculate the similarities among the workers according to which the workers can be clustered gradually. The unknown answers (or outputs) of the tasks are predicted from the results obtained by the clustered workers which will further help with the similarity calculation and the clustering among the remaining workers. A framework and detailed schemes are presented, and simulation experiments are conducted to validate the efficacy of the approach.\",\"PeriodicalId\":370356,\"journal\":{\"name\":\"International Conference on Crowd Science and Engineering\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Crowd Science and Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3265689.3265714\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Crowd Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3265689.3265714","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

工人响应的质量管理是众包中一个越来越重要的问题,它可以作为工作量分配的基本参考。然而,大多数现有的工人响应评估解决方案都面临着重大挑战。其中一部分算法只能获得局部最优结果,精度较低,而另一部分算法则需要付出高昂的代价才能实现全局最优。为了应对这些挑战,本文提出了一种能够在可接受的计算开销下获得接近全局最优评价结果的工人素质管理解决方案。在一定条件下,证明了该方法是全局最优的。该方法的基本思想是计算工人之间的相似度,根据相似度可以逐步聚类工人。从聚类工人获得的结果中预测任务的未知答案(或输出),这将进一步帮助相似度计算和剩余工人之间的聚类。提出了该方法的框架和具体方案,并通过仿真实验验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CrowdMerge: Achieving Optimal Crowdsourcing Quality Management by Sequent Merger
Quality management of worker responses is an increasingly important issue in crowdsourcing, which can be a fundamental reference for workload allocation. However, most of the existing solutions to worker response evaluation meet with significant challenges. Part of them are only able to obtain locally optimal results with low accuracy, while the others have to pay a high price to achieve global optimality. In order to tackle these challenges, this paper proposes a solution to worker quality management which is able to obtain optimal evaluation results close to the globally one with acceptable computational overhead. It is proved to be globally optimal results under certain conditions. The basic idea of the approach is to calculate the similarities among the workers according to which the workers can be clustered gradually. The unknown answers (or outputs) of the tasks are predicted from the results obtained by the clustered workers which will further help with the similarity calculation and the clustering among the remaining workers. A framework and detailed schemes are presented, and simulation experiments are conducted to validate the efficacy of the approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信