用于停车占用预测的可转移上下文特征聚类

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS
Wei Shao , Yu Zhang , Pengfei Xiao , Kyle Kai Qin , Mohammad Saiedur Rahaman , Jeffrey Chan , Bin Guo , Andy Song , Flora D. Salim
{"title":"用于停车占用预测的可转移上下文特征聚类","authors":"Wei Shao ,&nbsp;Yu Zhang ,&nbsp;Pengfei Xiao ,&nbsp;Kyle Kai Qin ,&nbsp;Mohammad Saiedur Rahaman ,&nbsp;Jeffrey Chan ,&nbsp;Bin Guo ,&nbsp;Andy Song ,&nbsp;Flora D. Salim","doi":"10.1016/j.pmcj.2023.101831","DOIUrl":null,"url":null,"abstract":"<div><p>Recently, real-time parking availability prediction has attracted much attention since the rapid development of sensor technologies and urbanisation. Most existing works have applied various models to predict long and short-term parking occupancy using historical records. However, historical records are not available for many real-world scenarios, such as <em>new urban areas</em><span>, where parking lots are fast adjusted and extended. In this paper, we aim to predict parking occupancy using historical data in other areas and contextual information within the targeted area that lacks historical data. We propose a two-step framework to first learn the important contextual features from areas where parking records already existed. Then we transfer these features to the other new areas without historical data records. Through conducting a real-world dataset with various clustering methods combined with different regression models, we observe that multiple contextual features are likely to influence parking availability prediction. We find the best combination (i.e., </span><span><math><mi>k</mi></math></span><span>-shape clustering algorithm<span> and LSTM regression model) to build parking occupancy prediction model based on the subsequent quantitative correlation analysis between contextual features and parking occupancy. The experimental results show that (1) the conventional internal clustering evaluation does not work well for spatio-temporal data clustering for the prediction purpose; (2) our proposed approach achieves approximately 3% error rate in 30 minutes of prediction, which is significantly better than the estimation of the occupancy rate using the rate in the adjacent regions (13.3%).</span></span></p></div>","PeriodicalId":49005,"journal":{"name":"Pervasive and Mobile Computing","volume":"97 ","pages":"Article 101831"},"PeriodicalIF":3.0000,"publicationDate":"2023-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Transferrable contextual feature clusters for parking occupancy prediction\",\"authors\":\"Wei Shao ,&nbsp;Yu Zhang ,&nbsp;Pengfei Xiao ,&nbsp;Kyle Kai Qin ,&nbsp;Mohammad Saiedur Rahaman ,&nbsp;Jeffrey Chan ,&nbsp;Bin Guo ,&nbsp;Andy Song ,&nbsp;Flora D. Salim\",\"doi\":\"10.1016/j.pmcj.2023.101831\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Recently, real-time parking availability prediction has attracted much attention since the rapid development of sensor technologies and urbanisation. Most existing works have applied various models to predict long and short-term parking occupancy using historical records. However, historical records are not available for many real-world scenarios, such as <em>new urban areas</em><span>, where parking lots are fast adjusted and extended. In this paper, we aim to predict parking occupancy using historical data in other areas and contextual information within the targeted area that lacks historical data. We propose a two-step framework to first learn the important contextual features from areas where parking records already existed. Then we transfer these features to the other new areas without historical data records. Through conducting a real-world dataset with various clustering methods combined with different regression models, we observe that multiple contextual features are likely to influence parking availability prediction. We find the best combination (i.e., </span><span><math><mi>k</mi></math></span><span>-shape clustering algorithm<span> and LSTM regression model) to build parking occupancy prediction model based on the subsequent quantitative correlation analysis between contextual features and parking occupancy. The experimental results show that (1) the conventional internal clustering evaluation does not work well for spatio-temporal data clustering for the prediction purpose; (2) our proposed approach achieves approximately 3% error rate in 30 minutes of prediction, which is significantly better than the estimation of the occupancy rate using the rate in the adjacent regions (13.3%).</span></span></p></div>\",\"PeriodicalId\":49005,\"journal\":{\"name\":\"Pervasive and Mobile Computing\",\"volume\":\"97 \",\"pages\":\"Article 101831\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2023-08-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Pervasive and Mobile Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1574119223000895\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pervasive and Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574119223000895","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,随着传感器技术的快速发展和城市化进程的加快,实时车位可用性预测受到了人们的广泛关注。现有的大部分工作都是利用历史记录应用各种模型来预测长期和短期的停车占用情况。然而,许多现实场景的历史记录是不可用的,比如新的城市地区,那里的停车场被快速调整和扩展。在本文中,我们的目标是利用其他区域的历史数据和目标区域内缺乏历史数据的上下文信息来预测停车占用情况。我们提出了一个两步框架,首先从已经存在停车记录的地区了解重要的背景特征。然后我们将这些特征转移到其他没有历史数据记录的新区域。通过使用多种聚类方法结合不同回归模型的真实数据集,我们观察到多种上下文特征可能会影响停车可用性预测。在后续对上下文特征与停车占用率进行定量相关性分析的基础上,找到最佳组合(即k形聚类算法与LSTM回归模型)构建停车占用率预测模型。实验结果表明:(1)传统的内部聚类评价方法不能很好地用于以预测为目的的时空数据聚类;(2)我们提出的方法在30分钟的预测错误率约为3%,明显优于使用相邻区域的入住率来估计入住率(13.3%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transferrable contextual feature clusters for parking occupancy prediction

Recently, real-time parking availability prediction has attracted much attention since the rapid development of sensor technologies and urbanisation. Most existing works have applied various models to predict long and short-term parking occupancy using historical records. However, historical records are not available for many real-world scenarios, such as new urban areas, where parking lots are fast adjusted and extended. In this paper, we aim to predict parking occupancy using historical data in other areas and contextual information within the targeted area that lacks historical data. We propose a two-step framework to first learn the important contextual features from areas where parking records already existed. Then we transfer these features to the other new areas without historical data records. Through conducting a real-world dataset with various clustering methods combined with different regression models, we observe that multiple contextual features are likely to influence parking availability prediction. We find the best combination (i.e., k-shape clustering algorithm and LSTM regression model) to build parking occupancy prediction model based on the subsequent quantitative correlation analysis between contextual features and parking occupancy. The experimental results show that (1) the conventional internal clustering evaluation does not work well for spatio-temporal data clustering for the prediction purpose; (2) our proposed approach achieves approximately 3% error rate in 30 minutes of prediction, which is significantly better than the estimation of the occupancy rate using the rate in the adjacent regions (13.3%).

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Pervasive and Mobile Computing
Pervasive and Mobile Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-TELECOMMUNICATIONS
CiteScore
7.70
自引率
2.30%
发文量
80
审稿时长
68 days
期刊介绍: As envisioned by Mark Weiser as early as 1991, pervasive computing systems and services have truly become integral parts of our daily lives. Tremendous developments in a multitude of technologies ranging from personalized and embedded smart devices (e.g., smartphones, sensors, wearables, IoTs, etc.) to ubiquitous connectivity, via a variety of wireless mobile communications and cognitive networking infrastructures, to advanced computing techniques (including edge, fog and cloud) and user-friendly middleware services and platforms have significantly contributed to the unprecedented advances in pervasive and mobile computing. Cutting-edge applications and paradigms have evolved, such as cyber-physical systems and smart environments (e.g., smart city, smart energy, smart transportation, smart healthcare, etc.) that also involve human in the loop through social interactions and participatory and/or mobile crowd sensing, for example. The goal of pervasive computing systems is to improve human experience and quality of life, without explicit awareness of the underlying communications and computing technologies. The Pervasive and Mobile Computing Journal (PMC) is a high-impact, peer-reviewed technical journal that publishes high-quality scientific articles spanning theory and practice, and covering all aspects of pervasive and mobile computing and systems.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信