根据历史轨迹数据,在感兴趣的地区推荐最受欢迎的旅行路线

Samia Shafique, Mohammed Eunus Ali
{"title":"根据历史轨迹数据,在感兴趣的地区推荐最受欢迎的旅行路线","authors":"Samia Shafique, Mohammed Eunus Ali","doi":"10.1145/3004725.3004728","DOIUrl":null,"url":null,"abstract":"Advancement in mobile and GPS technologies have enabled users to record and publish their route activities or trajectories through location based social networking sites. Existing research mainly focus on finding popular routes and recommending suitable routes for the users based on the historical movements of users between different Point of Interests (POIs). However, users often spend most of their time around different POIs (e.g., Colosseo) and less time traveling between POIs. Thus, existing methods fail to capture the detailed movement of users around a POI, which we call Region of Interest (ROI). A major challenge of identifying patterns of routes inside an ROI comes from the inaccurate and incomplete data of user trajectories. In this paper we propose a novel technique to find the most popular path within an ROI from historical trajectory data by rephrasing trajectories into smaller part and eliminating noisy points from trajectories. We then devise an algorithm to produce the most popular path inside each ROI. We perform experiments on a real dataset extracted from Flickr to show the effectiveness of our approach.","PeriodicalId":154980,"journal":{"name":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Recommending most popular travel path within a region of interest from historical trajectory data\",\"authors\":\"Samia Shafique, Mohammed Eunus Ali\",\"doi\":\"10.1145/3004725.3004728\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Advancement in mobile and GPS technologies have enabled users to record and publish their route activities or trajectories through location based social networking sites. Existing research mainly focus on finding popular routes and recommending suitable routes for the users based on the historical movements of users between different Point of Interests (POIs). However, users often spend most of their time around different POIs (e.g., Colosseo) and less time traveling between POIs. Thus, existing methods fail to capture the detailed movement of users around a POI, which we call Region of Interest (ROI). A major challenge of identifying patterns of routes inside an ROI comes from the inaccurate and incomplete data of user trajectories. In this paper we propose a novel technique to find the most popular path within an ROI from historical trajectory data by rephrasing trajectories into smaller part and eliminating noisy points from trajectories. We then devise an algorithm to produce the most popular path inside each ROI. We perform experiments on a real dataset extracted from Flickr to show the effectiveness of our approach.\",\"PeriodicalId\":154980,\"journal\":{\"name\":\"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3004725.3004728\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 5th ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3004725.3004728","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

移动和GPS技术的进步使用户能够通过基于位置的社交网站记录和发布他们的路线活动或轨迹。现有的研究主要集中在基于用户在不同兴趣点之间的历史运动来寻找热门路线并为用户推荐合适的路线。然而,用户通常将大部分时间花在不同的poi(例如,Colosseo)上,而在poi之间花费的时间较少。因此,现有的方法无法捕获POI周围用户的详细移动,我们称之为兴趣区域(ROI)。识别ROI内路线模式的主要挑战来自用户轨迹数据的不准确和不完整。本文提出了一种从历史轨迹数据中找到ROI内最受欢迎的路径的新技术,该技术通过将轨迹重新描述为更小的部分并消除轨迹中的噪声点。然后,我们设计了一种算法来生成每个ROI内最受欢迎的路径。我们对从Flickr提取的真实数据集进行了实验,以显示我们方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Recommending most popular travel path within a region of interest from historical trajectory data
Advancement in mobile and GPS technologies have enabled users to record and publish their route activities or trajectories through location based social networking sites. Existing research mainly focus on finding popular routes and recommending suitable routes for the users based on the historical movements of users between different Point of Interests (POIs). However, users often spend most of their time around different POIs (e.g., Colosseo) and less time traveling between POIs. Thus, existing methods fail to capture the detailed movement of users around a POI, which we call Region of Interest (ROI). A major challenge of identifying patterns of routes inside an ROI comes from the inaccurate and incomplete data of user trajectories. In this paper we propose a novel technique to find the most popular path within an ROI from historical trajectory data by rephrasing trajectories into smaller part and eliminating noisy points from trajectories. We then devise an algorithm to produce the most popular path inside each ROI. We perform experiments on a real dataset extracted from Flickr to show the effectiveness of our approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信