Task Recommendation in Spatial Crowdsourcing: A Trade-Off Between Diversity and Coverage
Liwei Deng, Yan Zhao, Yue Cui, Yuyang Xia, Jin Chen, Kai Zheng
摘要
The popularity of mobile devices has led to the increased attention of Spatial Crowdsourcing (SC), a framework that assigns location-sensitive tasks to mobile workers. Task recommendation is crucial in helping workers discover attractive tasks. Existing studies have focused on modeling workers' preferences from past task-performing patterns, but their performance is sub-optimal due to the strong coupling of sequentiality, spatiality, and temporality. Moreover, achieving the highest preference-based utility of workers in most of the existing task recommendation studies is inferior to the benefits of the SC platform and the satisfaction of workers in a long range, due to the lower task coverage rate and the poor diversity in a worker's recommended list. To address these problems, we propose a Diversity-Coverage Balanced Task Recommendation (DCBTaskRec) framework. Specifically, we first introduce a decoupled worker preference learning model that adopts self-attention networks as the backbone and decouples the modeling of multiple factors in attention scores. Additionally, we provide an optimal diveristy-aware approach to maximize the recommendation diversity while keeping high preference-based utility of workers to satisfy the multiple tastes of workers. From the side of the SC platform, we also provide two approaches (i.e., greedy coverage-aware approach and diversity-coverage balanced approach) to achieve high coverage and provide a trade-off between diversity and coverage, respectively. Extensive experiments offer insight into the effectiveness of the proposed framework.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- Efficient Large-Scale Traffic Forecasting with Transformers: A Spatial Data Management PerspectiveYuchen Fang, Yuxuan Liang, Bo Hui, Zezhi Shao 等KDD 2025 · 被引用 26 次
- Optimizing Multi-Center Collaboration for Task Assignment in Spatial CrowdsourcingXimu Zeng, Jianxing Lin, Liwei Deng, Yuchen Fang 等ICDE 2025 · 被引用 6 次
- Leveraging Multimodal Data and Side Users for Diffusion Cross-Domain RecommendationFan Zhang, Jinpeng Chen, Huan Li, Senzhang Wang 等ACM MM 2025 · 被引用 5 次
- DATA-WA: Demand-Based Adaptive Task Assignment with Dynamic Worker Availability WindowsJinwen Chen, Jiannan Guo, Dazhuo Qiu, Yawen Li 等ICDE 2025 · 被引用 4 次
- GKD-Recruiter: Jointly Modeling Social and Task Heterogeneity for Spatial Crowdsourcing via Graph Knowledge DistillationYucen Gao, Zhemeng Yu, Zhuoran Li, Jianxiong Guo 等ICML 2026
它引用的顶会 Paper10
- STAN: Spatio-Temporal Attention Network for Next Location RecommendationYingtao Luo, Qiang Liu, Zhaocheng LiuWWW 2021 · 被引用 438 次
- Graph-Flashback Network for Next Location RecommendationXuan Rao, Lisi Chen, Yong Liu, Shuo Shang 等KDD 2022 · 被引用 144 次
- MobTCast: Leveraging Auxiliary Trajectory Forecasting for Human Mobility PredictionHao Xue, Flora D. Salim, Yongli Ren, Nuria OliverNeurIPS 2021 · 被引用 106 次
- Predictive Task Assignment in Spatial Crowdsourcing: A Data-driven ApproachYan Zhao, Kai Zheng, Yue Cui, Han Su 等ICDE 2020 · 被引用 86 次
- Fairness-aware Task Assignment in Spatial Crowdsourcing: Game-Theoretic ApproachesYan Zhao, Kai Zheng, Jiannan Guo, Bin Yang 等ICDE 2021 · 被引用 81 次
相关 Paper
- Balancing Competition for Fairness-Aware Task Recommendation and Assignment in Spatial CrowdsourcingJinwen Chen, Hao Miao, Lei Jia, Guangqiang Yin 等ICDE 2026
- Sustainability-Oriented Task Recommendation in Spatial CrowdsourcingJinwen Chen, Hao Miao, Dazhuo Qiu, Jiannan Guo 等ICDE 2025 · 被引用 2 次
- Effective Task Assignment in Mobility Prediction-Aware Spatial CrowdsourcingHuiling Li, Yafei Li, Wei Chen, Shuo He 等ICDE 2025 · 被引用 5 次
- An End-to-End Deep RL Framework for Task Arrangement in Crowdsourcing PlatformsCaihua Shan, Nikos Mamoulis, Reynold Cheng, Guoliang Li 等ICDE 2020 · 被引用 23 次
- Influence-aware Task Assignment in Spatial CrowdsourcingXuanhao Chen, Yan Zhao, Kai Zheng, Bin Yang 等ICDE 2022 · 被引用 18 次
