4.7 Article

Preference-Aware Group Task Assignment in Spatial Crowdsourcing: Effectiveness and Efficiency

期刊

出版社

IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2023.3266735

关键词

Task analysis; Crowdsourcing; Mutual information; Proposals; Monitoring; Prediction algorithms; Adaptation models; Group task assignment; mutual information; preference; spatial crowdsourcing

向作者/读者索取更多资源

This paper proposes a novel preference-aware group task assignment framework for spatial crowdsourcing, which includes two components: Mutual Information-based Preference Modeling and Preference-aware Group Task Assignment. The framework learns group preferences using mutual information and weights group members adaptively. It also employs tree decomposition to assign tasks to appropriate worker groups, prioritizing more interested groups.
With the diffusion of online mobile devices with geo-location capabilities, the infrastructure necessary for real-world deployment of Spatial Crowdsourcing (SC), where so-called mobile workers are assigned location-sensitive tasks, is in place. Some SC tasks cannot be completed by a single worker due to their complexity, but rather must be assigned to and completed by a group of users. Achieving such group assignments that satisfy all group members evenly is an open challenge. To address this challenge, we propose a novel preference-aware group task assignment framework encompassing two components: Mutual Information-based Preference Modeling (MIPM) and Preference-aware Group Task Assignment (PGTA). The MIPM component learns the preferences of groups contrastively by maximizing the mutual information between workers and worker groups based on worker-task and group-task interaction data and by using an attention mechanism to weight group members adaptively. In addition, curriculum negative sampling is adopted to generate a small number of negative workers for each worker group, following the principles of curriculum learning. Next, the PGTA component offers an optimal task assignment algorithm that employs tree decomposition to assign tasks to appropriate worker groups, with the aim of maximizing the number of task assignments while prioritizing more interested groups when assigning tasks. The task assignment framework also features preference-constrained pruning of unpromising worker groups to speed up the assignment process. Finally, we report extensive experiments that offer evidence of the effectiveness and practicality of the paper's proposal.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据