{"title":"众包市场中基于适用性的任务分配","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":"{\"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}","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}
Suitability-based Task Assignment in Crowdsourcing Markets
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.