空间众包中的偏好感知群体任务分配:一种基于互信息的方法

Yunchuan Li, Yan Zhao, Kai Zheng
{"title":"空间众包中的偏好感知群体任务分配:一种基于互信息的方法","authors":"Yunchuan Li, Yan Zhao, Kai Zheng","doi":"10.1109/ICDM51629.2021.00046","DOIUrl":null,"url":null,"abstract":"With the popularity of GPS-enable smart devices and the development of wireless network, Spatial Crowdsourcing (SC), as a framework for assigning location-sensitive tasks to moving workers, has received wide attention in recent years. In real-world scenarios, some complex tasks exist that may not be completed by a single worker. In this case, the tasks are often assigned to multiple workers, which is called group task assignment. However, the assignment of tasks that satisfy all group members in an even way remains a challenge. To this end, we propose a novel preference-aware group task assignment framework that includes two components: Mutual Information-based Preference Modeling (MIPM) and Preference-aware Group Task Assignment (PGTA). Specifically, MIPM learns the preferences of worker groups by maximizing the mutual information among workers based on the worker-task interaction data and the group-task interaction data, where an attention mechanism is used. PGTA adopts an optimal task assignment algorithm based on tree decomposition to assign tasks to appropriate worker groups, which aims to maximize the overall number of assigned tasks while giving priority to the groups of workers that are more interested in the tasks. Finally, extensive experiments are conducted, verifying the effectiveness and practicality of the proposed solutions.","PeriodicalId":320970,"journal":{"name":"2021 IEEE International Conference on Data Mining (ICDM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Preference-aware Group Task Assignment in Spatial Crowdsourcing: A Mutual Information-based Approach\",\"authors\":\"Yunchuan Li, Yan Zhao, Kai Zheng\",\"doi\":\"10.1109/ICDM51629.2021.00046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the popularity of GPS-enable smart devices and the development of wireless network, Spatial Crowdsourcing (SC), as a framework for assigning location-sensitive tasks to moving workers, has received wide attention in recent years. In real-world scenarios, some complex tasks exist that may not be completed by a single worker. In this case, the tasks are often assigned to multiple workers, which is called group task assignment. However, the assignment of tasks that satisfy all group members in an even way remains a challenge. To this end, we propose a novel preference-aware group task assignment framework that includes two components: Mutual Information-based Preference Modeling (MIPM) and Preference-aware Group Task Assignment (PGTA). Specifically, MIPM learns the preferences of worker groups by maximizing the mutual information among workers based on the worker-task interaction data and the group-task interaction data, where an attention mechanism is used. PGTA adopts an optimal task assignment algorithm based on tree decomposition to assign tasks to appropriate worker groups, which aims to maximize the overall number of assigned tasks while giving priority to the groups of workers that are more interested in the tasks. Finally, extensive experiments are conducted, verifying the effectiveness and practicality of the proposed solutions.\",\"PeriodicalId\":320970,\"journal\":{\"name\":\"2021 IEEE International Conference on Data Mining (ICDM)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Data Mining (ICDM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDM51629.2021.00046\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Data Mining (ICDM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDM51629.2021.00046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

随着gps智能设备的普及和无线网络的发展,空间众包(Spatial Crowdsourcing, SC)作为一种为移动工作者分配位置敏感任务的框架,近年来受到了广泛关注。在现实场景中,存在一些复杂的任务,可能无法由单个工作人员完成。在这种情况下,任务通常分配给多个工作人员,这称为组任务分配。然而,如何以一种公平的方式分配让所有成员都满意的任务仍然是一个挑战。为此,我们提出了一个新的偏好感知群体任务分配框架,该框架包括两个组成部分:基于相互信息的偏好建模(MIPM)和偏好感知群体任务分配(PGTA)。具体来说,MIPM基于工人-任务交互数据和组-任务交互数据,通过最大化工人之间的相互信息来学习工人群体的偏好,其中使用了注意机制。PGTA采用基于树分解的最优任务分配算法,将任务分配到合适的工人组中,使分配的任务总数最大化,同时优先考虑对任务更感兴趣的工人组。最后,进行了大量的实验,验证了所提出解决方案的有效性和实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Preference-aware Group Task Assignment in Spatial Crowdsourcing: A Mutual Information-based Approach
With the popularity of GPS-enable smart devices and the development of wireless network, Spatial Crowdsourcing (SC), as a framework for assigning location-sensitive tasks to moving workers, has received wide attention in recent years. In real-world scenarios, some complex tasks exist that may not be completed by a single worker. In this case, the tasks are often assigned to multiple workers, which is called group task assignment. However, the assignment of tasks that satisfy all group members in an even way remains a challenge. To this end, we propose a novel preference-aware group task assignment framework that includes two components: Mutual Information-based Preference Modeling (MIPM) and Preference-aware Group Task Assignment (PGTA). Specifically, MIPM learns the preferences of worker groups by maximizing the mutual information among workers based on the worker-task interaction data and the group-task interaction data, where an attention mechanism is used. PGTA adopts an optimal task assignment algorithm based on tree decomposition to assign tasks to appropriate worker groups, which aims to maximize the overall number of assigned tasks while giving priority to the groups of workers that are more interested in the tasks. Finally, extensive experiments are conducted, verifying the effectiveness and practicality of the proposed solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信