A unified task recommendation strategy for realistic mobile crowdsourcing system

被引:5
|
作者
Li, Zhiyao [1 ]
Cheng, Bosen [1 ]
Gao, Xiaofeng [1 ]
Chen, Huai [2 ]
Chen, Guihai [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai Key Lab Scalable Comp & Syst, Shanghai 200240, Peoples R China
[2] Tencent Inc, Shenzhen, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Crowdsourcing; Recommendation system; K-medoids;
D O I
10.1016/j.tcs.2020.12.034
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A well-designed task recommendation framework aims to protect the data quality as well as increase the task execution results. However, current crowdsourcing systems ignore the fact that there are few duplicate task expectations because of the budget limitation in realistic conditions. Besides, a practical crowdsourcing system needs to recommend new tasks without previous knowledge about the concrete task content due to short task lifespan. Thus, most of the existing studies are not applicable due to the idealized assumptions. In this paper, we formally define the problem and prove it is NP Hard. For the problem, we design a unified task recommendation system for realistic conditions to address the mentioned problems, Pioneer-Assisted Task RecommendatiON (PATRON) framework. The framework first selects a set of pioneer workers to collect initial knowledge of the new tasks. Then it adopts the k-medoids clustering algorithm to split the workers into subsets based on the worker similarity. Cluster selection and worker pruning provides accurate and efficient recommendations that satisfy the valid recommendation requirements from requesters. Finally, we conducted our experiments based on real datasets from a famous Chinese crowdsourcing platform, Tencent SOHO. The experimental results show the efficiency and accuracy of PATRON compared with three baseline methods from several perspectives, such as recommendation success rate and recommended worker quality. (c) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页码:43 / 58
页数:16
相关论文
共 50 条
  • [1] Secure Task Recommendation in Crowdsourcing
    Shu, Jiangang
    Jia, Xiaohua
    2016 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2016,
  • [2] TasRec: A Framework for Task Recommendation in Crowdsourcing
    Abhinav, Kumar
    Bhatia, Gurpriya Kaur
    Dubey, Alpana
    Jain, Sakshi
    Bhardwaj, Nitish
    2020 ACM/IEEE 15TH INTERNATIONAL CONFERENCE ON GLOBAL SOFTWARE ENGINEERING, ICGSE, 2020, : 86 - 95
  • [3] Perceived Task Similarities for Task Recommendation in Crowdsourcing Systems
    Schnitzer, Steffen
    Neitzel, Svenja
    Schmidt, Sebastian
    Rensing, Christoph
    PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16 COMPANION), 2016, : 585 - 590
  • [4] Participation recommendation system for crowdsourcing contests
    Baba, Yukino
    Kinoshita, Kei
    Kashima, Hisashi
    EXPERT SYSTEMS WITH APPLICATIONS, 2016, 58 : 174 - 183
  • [5] Privacy-preserving task recommendation with win-win incentives for mobile crowdsourcing
    Tang, Wenjuan
    Zhang, Kuan
    Ren, Ju
    Zhang, Yaoxue
    Shen, Xuemin
    INFORMATION SCIENCES, 2020, 527 : 477 - 492
  • [6] TaskRec: A Task Recommendation Framework in Crowdsourcing Systems
    Yuen, Man-Ching
    King, Irwin
    Leung, Kwong-Sak
    NEURAL PROCESSING LETTERS, 2015, 41 (02) : 223 - 238
  • [7] TaskRec: A Task Recommendation Framework in Crowdsourcing Systems
    Man-Ching Yuen
    Irwin King
    Kwong-Sak Leung
    Neural Processing Letters, 2015, 41 : 223 - 238
  • [8] Task recommendation in crowdsourcing systems: A bibliometric analysis
    Yin, Xicheng
    Wang, Hongwei
    Wang, Wei
    Zhu, Kevin
    TECHNOLOGY IN SOCIETY, 2020, 63
  • [9] Privacy-Preserving Task Recommendation Services for Crowdsourcing
    Shu, Jiangang
    Jia, Xiaohua
    Yang, Kan
    Wang, Hua
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2021, 14 (01) : 235 - 247
  • [10] A task recommendation scheme for crowdsourcing based on expertise estimation
    Kurup, Ayswarya R.
    Sajeev, G. P.
    ELECTRONIC COMMERCE RESEARCH AND APPLICATIONS, 2020, 41 (41)