从GPS轨迹中挖掘频繁轨迹模式

Gang Chen, Baoquan Chen, Yizhou Yu
{"title":"从GPS轨迹中挖掘频繁轨迹模式","authors":"Gang Chen, Baoquan Chen, Yizhou Yu","doi":"10.1109/CISE.2010.5677000","DOIUrl":null,"url":null,"abstract":"As recent advances and wide usage of mobile devices with positioning capabilities, trajectory database that captures the historical movements of populations of moving objects becomes important. Given such a database that contains many taxi trajectories, we study a new problem of discovering frequent sequential patterns. The proposed method comprises two phases. First, we cluster the stay points of taxis to get collocation patterns for passengers. Then, for each pattern instance, we use an efficient graph-based searching algorithm to mine the frequent trajectory patterns, which utilizes the adjacency property to reduce the search space. The performance evaluation demonstrates that our method outperforms the Apriori-based and PrefixSpan-based methods.","PeriodicalId":232832,"journal":{"name":"2010 International Conference on Computational Intelligence and Software Engineering","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Mining Frequent Trajectory Patterns from GPS Tracks\",\"authors\":\"Gang Chen, Baoquan Chen, Yizhou Yu\",\"doi\":\"10.1109/CISE.2010.5677000\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As recent advances and wide usage of mobile devices with positioning capabilities, trajectory database that captures the historical movements of populations of moving objects becomes important. Given such a database that contains many taxi trajectories, we study a new problem of discovering frequent sequential patterns. The proposed method comprises two phases. First, we cluster the stay points of taxis to get collocation patterns for passengers. Then, for each pattern instance, we use an efficient graph-based searching algorithm to mine the frequent trajectory patterns, which utilizes the adjacency property to reduce the search space. The performance evaluation demonstrates that our method outperforms the Apriori-based and PrefixSpan-based methods.\",\"PeriodicalId\":232832,\"journal\":{\"name\":\"2010 International Conference on Computational Intelligence and Software Engineering\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Computational Intelligence and Software Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISE.2010.5677000\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Computational Intelligence and Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISE.2010.5677000","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

随着具有定位功能的移动设备的进步和广泛使用,捕捉移动物体群体历史运动的轨迹数据库变得重要。给定这样一个包含许多出租车轨迹的数据库,我们研究了一个发现频繁序列模式的新问题。该方法包括两个阶段。首先,对出租车的停留点进行聚类,得到乘客的搭配模式。然后,对于每个模式实例,我们使用一种高效的基于图的搜索算法来挖掘频繁轨迹模式,该算法利用邻接性来减少搜索空间。性能评估表明,我们的方法优于基于apriori和prefixspan的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mining Frequent Trajectory Patterns from GPS Tracks
As recent advances and wide usage of mobile devices with positioning capabilities, trajectory database that captures the historical movements of populations of moving objects becomes important. Given such a database that contains many taxi trajectories, we study a new problem of discovering frequent sequential patterns. The proposed method comprises two phases. First, we cluster the stay points of taxis to get collocation patterns for passengers. Then, for each pattern instance, we use an efficient graph-based searching algorithm to mine the frequent trajectory patterns, which utilizes the adjacency property to reduce the search space. The performance evaluation demonstrates that our method outperforms the Apriori-based and PrefixSpan-based methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信