Suitability-based Task Assignment in Crowdsourcing Markets

Pengwei Wang, Zhen Chen, Zhaohui Zhang
{"title":"Suitability-based Task Assignment in Crowdsourcing Markets","authors":"Pengwei Wang, Zhen Chen, Zhaohui Zhang","doi":"10.1109/SCC49832.2020.00054","DOIUrl":null,"url":null,"abstract":"Crowdsourcing web services has received much attention in recent years, which has been widely used in many fields, and provides important human computing services for the rapid development of AI. Crowdsourcing knowledge acquisition is one of the most important applications, which includes a series of work such as image annotation and picture classification. However, due to the differences in the difficulty of these tasks and the uncertainty of workers, how to make a reasonable task assignment while ensuring the completion of tasks becomes a big challenge. To this end, we introduce WordNet external knowledge base to help determine the difficulty of picture classification tasks. We refer to the e-sports rank mechanism and use dynamic update strategy to assess the actual ability of workers. A novel criterion affinity based on the weighted Euclidean distance with penalty factor is proposed to measure the suitability between tasks and workers. On this basis, the Kuhn-Munkres (KM) algorithm is used to solve the weighted bipartite graph matching problem. Through comparative experiments, the effectiveness of our proposed method is verified.","PeriodicalId":274909,"journal":{"name":"2020 IEEE International Conference on Services Computing (SCC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Conference on Services Computing (SCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCC49832.2020.00054","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Crowdsourcing web services has received much attention in recent years, which has been widely used in many fields, and provides important human computing services for the rapid development of AI. Crowdsourcing knowledge acquisition is one of the most important applications, which includes a series of work such as image annotation and picture classification. However, due to the differences in the difficulty of these tasks and the uncertainty of workers, how to make a reasonable task assignment while ensuring the completion of tasks becomes a big challenge. To this end, we introduce WordNet external knowledge base to help determine the difficulty of picture classification tasks. We refer to the e-sports rank mechanism and use dynamic update strategy to assess the actual ability of workers. A novel criterion affinity based on the weighted Euclidean distance with penalty factor is proposed to measure the suitability between tasks and workers. On this basis, the Kuhn-Munkres (KM) algorithm is used to solve the weighted bipartite graph matching problem. Through comparative experiments, the effectiveness of our proposed method is verified.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
众包市场中基于适用性的任务分配
众包web服务近年来备受关注,广泛应用于多个领域,为人工智能的快速发展提供了重要的人工计算服务。众包知识获取是其中最重要的应用之一,它包括图像标注和图像分类等一系列工作。然而,由于这些任务难度的差异和工作者的不确定性,如何在保证任务完成的同时进行合理的任务分配成为一个很大的挑战。为此,我们引入了WordNet外部知识库来帮助确定图像分类任务的难度。我们借鉴电子竞技排名机制,采用动态更新策略来评估工作人员的实际能力。提出了一种基于带惩罚因子的加权欧几里得距离的标准亲和度来衡量任务与工人之间的适宜性。在此基础上,采用Kuhn-Munkres (KM)算法求解加权二部图匹配问题。通过对比实验,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Message from the SCC 2020 Chairs A Process Convergence Approach for Crossover Services based on Message Flow Partition and Merging SCC 2020 Organizing Commitee An IoT-owned Service for Global IoT Device Discovery, Integration and (Re)use PETA: Privacy Enabled Task Allocation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1