Fine-grained Urban Prediction via Sparse Mobile CrowdSensing

Wenbin Liu, Yongjian Yang, E. Wang, Jie Wu
{"title":"Fine-grained Urban Prediction via Sparse Mobile CrowdSensing","authors":"Wenbin Liu, Yongjian Yang, E. Wang, Jie Wu","doi":"10.1109/MASS50613.2020.00041","DOIUrl":null,"url":null,"abstract":"Mobile CrowdSensing (MCS) has recently emerged as a practical paradigm for large-scale and fine-grained urban sensing systems. To reduce sensing cost, Sparse MCS only senses data from a few subareas instead of sensing the full map, while the other unsensed subareas could be inferred by the intradata correlations among the sensed data. In certain applications, users are not only interested in inferring the data of other unsensed subareas in the current sensing cycle, but also interested in predicting the full map data of the near future sensing cycles. However, the intradata correlations exploited from the historical sparse sensed data cannot be effectively used for predicting full data in the temporal-spatial domain. To address this problem, in this paper, we propose an urban prediction scheme via Sparse MCS consisting of the matrix completion and the near-future prediction. To effectively utilize the sparse sensed data for prediction, we first present a bipartite-graph-based matrix completion algorithm with temporal-spatial constraints to accurately recover the unsensed data and preserve the temporal-spatial correlations. Then, for predicting the fine-grained future sensing map, with the historical full sensing data, we further propose a neural-network-based continuous conditional random field, including a Long Short-Term Memory component to learn the non-linear temporal relationships, and a Stacked Denoising Auto-Encoder component to learn the pairwise spatial correlations. Extensive experiments have been conducted on three real-world urban sensing data sets consisting of five typical sensing tasks, which verify the effectiveness of our proposed algorithms in improving the prediction accuracy with the sparse sensed data.","PeriodicalId":105795,"journal":{"name":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 17th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASS50613.2020.00041","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Mobile CrowdSensing (MCS) has recently emerged as a practical paradigm for large-scale and fine-grained urban sensing systems. To reduce sensing cost, Sparse MCS only senses data from a few subareas instead of sensing the full map, while the other unsensed subareas could be inferred by the intradata correlations among the sensed data. In certain applications, users are not only interested in inferring the data of other unsensed subareas in the current sensing cycle, but also interested in predicting the full map data of the near future sensing cycles. However, the intradata correlations exploited from the historical sparse sensed data cannot be effectively used for predicting full data in the temporal-spatial domain. To address this problem, in this paper, we propose an urban prediction scheme via Sparse MCS consisting of the matrix completion and the near-future prediction. To effectively utilize the sparse sensed data for prediction, we first present a bipartite-graph-based matrix completion algorithm with temporal-spatial constraints to accurately recover the unsensed data and preserve the temporal-spatial correlations. Then, for predicting the fine-grained future sensing map, with the historical full sensing data, we further propose a neural-network-based continuous conditional random field, including a Long Short-Term Memory component to learn the non-linear temporal relationships, and a Stacked Denoising Auto-Encoder component to learn the pairwise spatial correlations. Extensive experiments have been conducted on three real-world urban sensing data sets consisting of five typical sensing tasks, which verify the effectiveness of our proposed algorithms in improving the prediction accuracy with the sparse sensed data.
基于稀疏移动众感的细粒度城市预测
移动群体传感(MCS)最近成为大规模和细粒度城市传感系统的实用范例。为了降低感知成本,稀疏MCS仅从几个子区域感知数据,而不是感知整个地图,而其他未被感知的子区域可以通过被感知数据之间的数据内相关性来推断。在某些应用中,用户不仅对推断当前感知周期中其他未感知子区域的数据感兴趣,而且对预测近期未来感知周期的完整地图数据感兴趣。然而,从历史稀疏感测数据中挖掘的数据内相关性不能有效地用于预测时空域的完整数据。为了解决这一问题,本文提出了一种由矩阵补全和近未来预测组成的稀疏MCS城市预测方案。为了有效地利用稀疏感测数据进行预测,首先提出了一种具有时空约束的基于二分图的矩阵补全算法,以准确地恢复未感测数据并保持时空相关性。然后,为了预测细粒度的未来感知地图,利用历史完整的感知数据,我们进一步提出了基于神经网络的连续条件随机场,包括学习非线性时间关系的长短期记忆组件和学习两两空间相关性的堆叠去噪自编码器组件。在包含五个典型传感任务的三个真实城市传感数据集上进行了大量实验,验证了本文算法在提高稀疏传感数据预测精度方面的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信