MAB-Based Reinforced Worker Selection Framework for Budgeted Spatial Crowdsensing

被引:43
作者
Gao, Xiaofeng [1 ]
Chen, Shenwei [1 ]
Chen, Guihai [1 ]
机构
[1] Shanghai Jiao Tong Univ, Dept Comp Sci & Engn, Shanghai Key Lab Scalable Comp & Syst, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Task analysis; Sensors; Crowdsensing; Resource management; Estimation; Data models; worker selection; multi-armed bandit; data aggregation;
D O I
10.1109/TKDE.2020.2992531
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Spatial crowdsensing is a special kind of crowdsourcing which allocates tasks to workers in some special places where workers can sense data for them. Due to the lack of priori information about the quality of workers and the ground truth, selecting the most suitable workers, which can guarantee the quality of the sensing tasks, remains a great challenge. In this paper, we propose a novel framework which can choose the most reliable workers among available workers under constraint budget. We model the quality of workers through two factors, bias and variance, which describe the continuous feature of sensing tasks. Our framework first allocate some calibration tasks to calibrate the bias and then iteratively estimate the workers variance more and more accurately. To choose more reliable workers, we face the exploration and exploitation dilemma. Therefore, we design a novel Multi-Armed Bandit (MAB) algorithm which based on Upper Confidence Bounds (UCB) scheme and combined with a weighted data aggregation scheme to estimate a more accurate ground truth of a sensing task. Futhermore, a dynamic budget allocation algorithm is designed to achieve global optimization. Then, we prove the expected sensing error can be bounded according to the regret bound of the MAB. In simulation experiments, we compare our algorithm with several baselines with real-world data set and it shows the effectiveness in inferring the ground truth with limited budget.
引用
收藏
页码:1303 / 1316
页数:14
相关论文
共 36 条
  • [1] [Anonymous], 2015, P 18 INT C EXT DAT T
  • [2] Antos A, 2008, LECT NOTES ARTIF INT, V5254, P287, DOI 10.1007/978-3-540-87987-9_25
  • [3] Finite-time analysis of the multiarmed bandit problem
    Auer, P
    Cesa-Bianchi, N
    Fischer, P
    [J]. MACHINE LEARNING, 2002, 47 (2-3) : 235 - 256
  • [4] Aydin BI, 2014, AAAI CONF ARTIF INTE, P2946
  • [5] Bubeck S, 2009, LECT NOTES ARTIF INT, V5809, P23, DOI 10.1007/978-3-642-04414-4_7
  • [6] Whom to Ask? Jury Selection for Decision Making Tasks on Micro-blog Services
    Cao, Caleb Chen
    She, Jieying
    Tong, Yongxin
    Chen, Lei
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (11): : 1495 - 1506
  • [7] FROG: A Fast and Reliable Crowdsourcing Framework
    Cheng, Peng
    Lian, Xiang
    Jian, Xun
    Chen, Lei
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2019, 31 (05) : 894 - 908
  • [8] DataTech, 2017, DAT MOD CONT PUBL DA
  • [9] A General Fine-Grained Truth Discovery Approach for Crowdsourced Data Aggregation
    Du, Yang
    Xu, Hongli
    Sun, Yu-E
    Huang, Liusheng
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2017), PT I, 2017, 10177 : 3 - 18
  • [10] iCrowd: An Adaptive Crowdsourcing Framework
    Fan, Ju
    Li, Guoliang
    Ooi, Beng Chin
    Tan, Kian-lee
    Fen, Jianhua
    [J]. SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, : 1015 - 1030