期刊文献+

时空众包环境下基于统计预测的自适应阈值算法 被引量:9

Adaptive threshold algorithm based on statistical prediction under spatial crowdsourcing environment
下载PDF
导出
摘要 针对时空众包环境下任务分配随机性过高且效用值不理想的问题,提出一种基于统计预测的自适应阈值算法。首先,实时统计众包平台中空闲的任务、工人及工作地点的数量以设置阈值;其次,通过历史数据分析将任务与工人的分布分为均衡的两个部分,并用Min-max normalization方法为每个任务匹配一个确定的工人;最后,计算匹配到的工人出现的概率,以验证任务分配的有效性。使用相同真实数据的实验结果证实,与随机阈值算法相比,基于统计预测的自适应阈值算法的效用值提升了7%;与贪心算法相比,其效用值提升了10%。实验结果表明,基于统计预测的自适应阈值算法能够减少任务分配过程中的随机性并提高效用值。 Focusing on the problem that the randomness of task assignment is too high and the utility value is not ideal under the spatial crowdsourcing environment, an adaptive threshold algorithm based on statistical prediction was proposed.Firstly, the numbers of free tasks, free workers and free positions in the crowdsourcing platform in real-time was counted to set the threshold value. Secondly, according to the historical statistical analysis, the distributions of tasks and workers were divided into two balanced parts, then the Min-max normalization method was applied to match each task to a certain worker.Finally, the probability of the appearance of the matched workers was calculated to verify the effectiveness of the task distribution. The experimental results on real data show that, compared with random threshold algorithm and greedy algorithm,the utility value of the proposed algorithm was increased by 7% and 10%, respectively. Experimental result indicates that the proposed adaptive threshold algorithm can reduce the randomness and improve the utility value in the process of task assignment.
作者 刘辉 李盛恩
出处 《计算机应用》 CSCD 北大核心 2018年第2期415-420,共6页 journal of Computer Applications
基金 国家自然科学基金资助项目(61170052) 济南市高校院所自主创新计划项目(201401211)~~
关键词 时空众包 在线任务分配 阈值算法 匹配策略 统计预测 spatial crowdsourcing online task assignment threshold algorithm matching strategy statistial prediction
  • 相关文献

参考文献3

二级参考文献38

  • 1刘云浩.群智感知计算[J].中国计算机学会通讯,2012,8(10):38-41.
  • 2Wang J, Kraska T, Franklin M], et al. Crowder: Crowd sourcing entity resolution[J]. Proceedings of the VLDB Endowment, 2012, 5(11): 1483-1494.
  • 3Wang J, Li G, Kraska T, et al. Leveraging transi ti ve relations for crowd sourced joins[C]//Proc of the 2013 Int Conf on Management of Data. New York: ACM. 2013: 229-240.
  • 4Demartini G, Difallah D E, Cudre-Mauroux P. Zen'Crowd , Leveraging probabilistic reasoning and crowdsourcing techniques for large-scale entity linking[C]//Proc of the 21st Int Conf on World Wide Web. New York: ACM, 2012: 469-478.
  • 5Karger D R, Oh S, Shah D. Iterative learning for reliable crowdsourcing systems[C]//Advances in Neural Information Processing Systems. La Jolla: NIPS, 2011: 1953-1961.
  • 6Lindley D V. On a measure of the information provided by an experiment[J]. The Annals of Mathematical Statistics, 1956,27: 986-1005.
  • 7Ye P, EDU U M D, Doermann D. Combining preference and absolute judgements in a crowd-sourced setting[C/OL]// Proc of ICML'13 Workshop: Machine Learning Meets Crowd sourcing.[2014-11-10]' http://www. ics. uci, edu/ qliul/MLcrowd_ICML_ workshop/.
  • 8Franklin M J, Kossmann D, Kraska T, et al. CrowdDB: Answering queries with crowdsourcing[C]//Proc of the 2011 ACM SIGMOD Int Conf on Management of Data. New York: ACM, 2011: 61-72.
  • 9Park H, Garcia-Molina H, Pang R, et al. Deco: A system for declarative crowdsourcing[J]. Proceedings of the VLDB Endowment, 2012, 5(12): 1990-1993.
  • 10Howe J. The Rise of Crowdsourcing[M]. San Francisco: Wired Magazine, 2006: 1-4.

共引文献55

同被引文献49

引证文献9

二级引证文献46

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部