用于高效轨迹模式挖掘的轻量级道路网络学习

G. Hu, Ning Duan, Jun Zhu
{"title":"用于高效轨迹模式挖掘的轻量级道路网络学习","authors":"G. Hu, Ning Duan, Jun Zhu","doi":"10.1109/SOLI.2016.7551666","DOIUrl":null,"url":null,"abstract":"Individual trajectory traces of different lengths often amount to hundreds or thousands of trajectory points distributed over continuous spatial space. This makes fast trajectory pattern mining very challenging. For road network constrained trajectories like vehicle trajectories, mapping raw trajectory points to road links is a natural calibration procedure that can greatly alleviate the complexity of subsequent pattern mining. However, road map is generally proprietary and imposes limitations on commercial applications. Although a variety of map inference approaches were proposed for the generation of general-purpose road map on the basis of trajectory traces, those procedures are generally too heavy to be applied in the calibration for trajectory pattern mining. In this paper, we propose the first lightweight approach to generate road network from trajectory traces in order to support trajectory pattern mining. The approach is composed of three steps: trajectory density map construction, a cell aggregation step and the final network links/nodes clustering. Only one input data scan and two iterations over trajectory dense areas are necessary during the whole progress. Equipped with the obtained road network, the mapping of trajectory points to road network elements is performed by simple spatial projection operations instead of map-matching process, the result of which supports an efficient trajectory pattern mining.","PeriodicalId":128068,"journal":{"name":"2016 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"308 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Lightweight road network learning for efficient trajectory pattern mining\",\"authors\":\"G. Hu, Ning Duan, Jun Zhu\",\"doi\":\"10.1109/SOLI.2016.7551666\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Individual trajectory traces of different lengths often amount to hundreds or thousands of trajectory points distributed over continuous spatial space. This makes fast trajectory pattern mining very challenging. For road network constrained trajectories like vehicle trajectories, mapping raw trajectory points to road links is a natural calibration procedure that can greatly alleviate the complexity of subsequent pattern mining. However, road map is generally proprietary and imposes limitations on commercial applications. Although a variety of map inference approaches were proposed for the generation of general-purpose road map on the basis of trajectory traces, those procedures are generally too heavy to be applied in the calibration for trajectory pattern mining. In this paper, we propose the first lightweight approach to generate road network from trajectory traces in order to support trajectory pattern mining. The approach is composed of three steps: trajectory density map construction, a cell aggregation step and the final network links/nodes clustering. Only one input data scan and two iterations over trajectory dense areas are necessary during the whole progress. Equipped with the obtained road network, the mapping of trajectory points to road network elements is performed by simple spatial projection operations instead of map-matching process, the result of which supports an efficient trajectory pattern mining.\",\"PeriodicalId\":128068,\"journal\":{\"name\":\"2016 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"volume\":\"308 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOLI.2016.7551666\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2016.7551666","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

不同长度的单个轨迹轨迹通常相当于分布在连续空间空间上的数百或数千个轨迹点。这使得快速轨迹模式挖掘非常具有挑战性。对于道路网络受限的轨迹,如车辆轨迹,将原始轨迹点映射到道路链路是一个自然的校准过程,可以大大降低后续模式挖掘的复杂性。然而,路线图通常是专有的,并且对商业应用程序施加了限制。虽然针对基于轨迹轨迹生成通用道路图提出了多种地图推理方法,但这些步骤过于繁琐,难以应用于轨迹模式挖掘的标定。在本文中,我们提出了第一种从轨迹轨迹生成道路网络的轻量级方法,以支持轨迹模式挖掘。该方法由三个步骤组成:轨迹密度图构建,单元聚集步骤和最终的网络链路/节点聚类。在整个过程中,只需要一次输入数据扫描和两次轨迹密集区域迭代。利用得到的道路网,通过简单的空间投影操作将轨迹点映射到道路网元上,而不是进行地图匹配过程,从而支持有效的轨迹模式挖掘。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Lightweight road network learning for efficient trajectory pattern mining
Individual trajectory traces of different lengths often amount to hundreds or thousands of trajectory points distributed over continuous spatial space. This makes fast trajectory pattern mining very challenging. For road network constrained trajectories like vehicle trajectories, mapping raw trajectory points to road links is a natural calibration procedure that can greatly alleviate the complexity of subsequent pattern mining. However, road map is generally proprietary and imposes limitations on commercial applications. Although a variety of map inference approaches were proposed for the generation of general-purpose road map on the basis of trajectory traces, those procedures are generally too heavy to be applied in the calibration for trajectory pattern mining. In this paper, we propose the first lightweight approach to generate road network from trajectory traces in order to support trajectory pattern mining. The approach is composed of three steps: trajectory density map construction, a cell aggregation step and the final network links/nodes clustering. Only one input data scan and two iterations over trajectory dense areas are necessary during the whole progress. Equipped with the obtained road network, the mapping of trajectory points to road network elements is performed by simple spatial projection operations instead of map-matching process, the result of which supports an efficient trajectory pattern mining.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A simple and effective method for the use of chemical accident cases Shift to social manufacturing: Applications of additive manufacturing for consumer products Contributions of social manufacturing to sustainable apparel industry Applying the principles of social manufacturing to chemical process-related value chains Public service management system of urban placenames for Sanya case
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1