arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.0223cs.DB
收藏

基于移动工作者的可靠多样性空间众包

Reliable Diversity-Based Spatial Crowdsourcing by Moving Workers

Peng Cheng, Xiang Lian, Zhao Chen, Rui Fu, Lei Chen, Jinsong Han, Jizhong Zhao

摘要:

随着移动设备和众包平台的快速发展,空间众包引起了数据库界的广泛关注,空间众包是指根据工作人员的位置向其发送基于位置的请求。在本文中,我们考虑了一个重要的空间众包问题,即可靠的基于多样性的空间众包(RDB-SC),其中空间任务(如拍摄地标或烟花表演的视频/照片,并检查是否有停车位)是有时间限制的,工人正在向一些方向移动。我们的RDB-SC问题是分配工人的空间任务,使完成的可靠性和空间/时间的空间任务的分散性最大化。我们证明RDB-SC问题是NP-难的和棘手的。因此,我们提出了三种有效的近似方法,包括贪婪,采样和分治算法。为了提高效率,设计了一种基于成本模型的索引,能够以较低的成本动态维护移动的工作者和空间任务,并有效地促进RDB-SC答案的检索。通过大量的实验,我们证明了我们提出的方法在真实和合成数据集的效率和有效性。

英文摘要:

With the rapid development of mobile devices and the crowdsourcig platforms, the spatial crowdsourcing has attracted much attention from the database community, specifically, spatial crowdsourcing refers to sending a location-based request to workers according to their positions. In this paper, we consider an important spatial crowdsourcing problem, namely reliable diversity-based spatial crowdsourcing (RDB-SC), in which spatial tasks (such as taking videos/photos of a landmark or firework shows, and checking whether or not parking spaces are available) are time-constrained, and workers are moving towards some directions. Our RDB-SC problem is to assign workers to spatial tasks such that the completion reliability and the spatial/temporal diversities of spatial tasks are maximized. We prove that the RDB-SC problem is NP-hard and intractable. Thus, we propose three effective approximation approaches, including greedy, sampling, and divide-and-conquer algorithms. In order to improve the efficiency, we also design an effective cost-model-based index, which can dynamically maintain moving workers and spatial tasks with low cost, and efficiently facilitate the retrieval of RDB-SC answers. Through extensive experiments, we demonstrate the efficiency and effectiveness of our proposed approaches over both real and synthetic data sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑