AdaTaskRec: An Adaptive Task Recommendation Framework in Spatial Crowdsourcing

Author:

Zhao Yan1ORCID,Deng Liwei2ORCID,Zheng Kai3ORCID

Affiliation:

1. Department of Computer Science, Aalborg University, Denmark

2. School of Computer Science and Engineering, University of Electronic Science and Technology of China, China

3. Yangtze Delta Region Institute (Quzhou), School of Computer Science and Engineering, Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, China

Abstract

Spatial crowdsourcing is one of the prime movers for the orchestration of location-based tasks, and task recommendation is a crucial means to help workers discover attractive tasks. While a number of existing studies have focused on modeling workers’ geographical preferences in task recommendation, they ignore the phenomenon of workers’ travel intention drifts across geographical areas, i.e., workers tend to have different intentions when they travel in different areas, which discounts the task recommendation quality of existing methods especially for workers that travel in unfamiliar out-of-town areas. To address this problem, we propose an Adaptive Task Recommendation ( AdaTaskRec ) framework. Specifically, we first give a novel two-module worker preference learning architecture that can calculate workers’ preferences for POIs (that tasks are associated with) in different areas adaptively based on workers’ current locations. If we detect that a worker is in the hometown area, then we apply the hometown preference learning module, which hybrids different strategies to aggregate workers’ travel intentions into their preferences while considering the transition and the sequence patterns among locations. Otherwise, we invoke the out-of-town preference learning module, which is to capture workers’ preferences by learning their travel intentions and transferring their hometown preferences into their out-of-town ones. Additionally, to improve task recommendation effectiveness, we propose a dynamic top- k recommendation method that sets different k values dynamically according to the numbers of neighboring workers and tasks. We also give an extra-reward-based and a fair top- k recommendation method, which introduce the extra rewards for tasks based on their recommendation rounds and consider exposure-based fairness of tasks, respectively. Extensive experiments offer insight into the effectiveness of the proposed framework.

Funder

NSFC

Shenzhen Municipal Science and Technology R&D Funding Basic Research Program

Municipal Government of Quzhou

Key Laboratory of Data Intelligence and Cognitive Computing, Longhua District, Shenzhen

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,General Business, Management and Accounting,Information Systems

Reference62 articles.

1. Himan Abdollahpouri and Robin Burke. 2019. Multi-stakeholder recommendation and its connection to multi-sided fairness. CoRR abs/1907.13158 (2019).

2. Abdulrahman Alamer, Jianbing Ni, Xiaodong Lin, and Xuemin Shen. 2017. Location privacy-aware task recommendation for spatial crowdsourcing. In WCSP. 1–6.

3. Multisided fairness for recommendation;Burke Robin;CoRR,2017

4. Cen Chen, Shih-Fen Cheng, Hoong Chuin Lau, and Archan Misra. 2015. Towards city-scale mobile crowdsourcing: Task recommendations under trajectory uncertainties. In IJCAI. 1113–1119.

5. Xuanlei Chen, Yan Zhao, and Kai Zheng. 2022. Task publication time recommendation in spatial crowdsourcing. In CIKM. 232–241.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3