从轨迹中发现个性化路线

Kai-Ping Chang, Ling-Yin Wei, Mi-Yen Yeh, Wen-Chih Peng
{"title":"从轨迹中发现个性化路线","authors":"Kai-Ping Chang, Ling-Yin Wei, Mi-Yen Yeh, Wen-Chih Peng","doi":"10.1145/2063212.2063218","DOIUrl":null,"url":null,"abstract":"Most people usually drive their familiar routes to work and are concerned about the traffic on their way to work. If a driver's preferred route is known, the traffic congestion information on his/her way to work will be reported in time. However, the current navigation systems focus on planning the shortest path or the fastest path from a given start point to a given destination point. In this paper, we present a novel personalized route planning framework that considers user movement behaviors. The proposed framework comprises two components, familiar road network construction and route planning. In the first component, we mine familiar road segments from a driver's historical trajectory dataset, and construct a familiar road network. For the second component, we propose an efficient route planning algorithm to generate the top-k familiar routes given a start point and a destination point. We evaluate the performance of our algorithm using a real dataset, and compare our algorithm with an existing approach in terms of effectiveness and efficiency.","PeriodicalId":107369,"journal":{"name":"Workshop on Location-based Social Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"48","resultStr":"{\"title\":\"Discovering personalized routes from trajectories\",\"authors\":\"Kai-Ping Chang, Ling-Yin Wei, Mi-Yen Yeh, Wen-Chih Peng\",\"doi\":\"10.1145/2063212.2063218\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most people usually drive their familiar routes to work and are concerned about the traffic on their way to work. If a driver's preferred route is known, the traffic congestion information on his/her way to work will be reported in time. However, the current navigation systems focus on planning the shortest path or the fastest path from a given start point to a given destination point. In this paper, we present a novel personalized route planning framework that considers user movement behaviors. The proposed framework comprises two components, familiar road network construction and route planning. In the first component, we mine familiar road segments from a driver's historical trajectory dataset, and construct a familiar road network. For the second component, we propose an efficient route planning algorithm to generate the top-k familiar routes given a start point and a destination point. We evaluate the performance of our algorithm using a real dataset, and compare our algorithm with an existing approach in terms of effectiveness and efficiency.\",\"PeriodicalId\":107369,\"journal\":{\"name\":\"Workshop on Location-based Social Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"48\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Location-based Social Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2063212.2063218\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Location-based Social Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2063212.2063218","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 48

摘要

大多数人通常开着熟悉的路线去上班,并且担心上班途中的交通状况。如果知道驾驶员的首选路线,则会及时报告其上班途中的交通拥堵信息。然而,目前的导航系统侧重于规划从给定起点到给定终点的最短路径或最快路径。本文提出了一种考虑用户移动行为的个性化路线规划框架。该框架由熟悉的路网建设和路线规划两部分组成。在第一个组件中,我们从驾驶员的历史轨迹数据集中挖掘熟悉的路段,并构建一个熟悉的道路网络。对于第二部分,我们提出了一种有效的路线规划算法,在给定起点和目的地的情况下生成top-k条熟悉的路线。我们使用真实数据集评估我们的算法的性能,并将我们的算法与现有方法在有效性和效率方面进行比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Discovering personalized routes from trajectories
Most people usually drive their familiar routes to work and are concerned about the traffic on their way to work. If a driver's preferred route is known, the traffic congestion information on his/her way to work will be reported in time. However, the current navigation systems focus on planning the shortest path or the fastest path from a given start point to a given destination point. In this paper, we present a novel personalized route planning framework that considers user movement behaviors. The proposed framework comprises two components, familiar road network construction and route planning. In the first component, we mine familiar road segments from a driver's historical trajectory dataset, and construct a familiar road network. For the second component, we propose an efficient route planning algorithm to generate the top-k familiar routes given a start point and a destination point. We evaluate the performance of our algorithm using a real dataset, and compare our algorithm with an existing approach in terms of effectiveness and efficiency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Forecasting location-based events with spatio-temporal storytelling VacationFinder: a tool for collecting, analyzing, and visualizing geotagged Twitter data to find top vacation spots Sophy: a morphological framework for structuring geo-referenced social media From where do tweets originate?: a GIS approach for user location inference WeiboStand: capturing Chinese breaking news using Weibo "tweets"
×
引用
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