Discovering periodic frequent travel patterns of individual metro passengers considering different time granularities and station attributes

IF 4.3 Q2 TRANSPORTATION
{"title":"Discovering periodic frequent travel patterns of individual metro passengers considering different time granularities and station attributes","authors":"","doi":"10.1016/j.ijtst.2023.03.003","DOIUrl":null,"url":null,"abstract":"<div><p>Periodic frequent pattern discovery is a non-trivial task to discover frequent patterns based on user interests using a periodicity measure. Although conventional algorithms for periodic frequent pattern detection have numerous applications, there is still little research on periodic frequent pattern detection of individual passengers in the metro. The travel behavior of individual passengers has complex spatio-temporal characteristics in the metro network, which may pose new challenges in discovering periodic frequent patterns of individual metro passengers and developing mining algorithms based on real-world smart card data. This study addresses these issues by proposing a novel pattern for metro passenger travel pattern called periodic frequent passenger traffic patterns with time granularities and station attributes (PFPTS). This discovered pattern can automatically capture the features of the temporal dimension (morning and evening peak hours, week) and the spatial dimension (entering and leaving stations). The corresponding complete mining algorithm with the PFPTS-tree structure has been developed. To evaluate the performance of PFPTS-tree, several experiments are conducted on one-year real-world smart card data collected by an automatic fare collection system in a certain large metro network. The results show that PFPTS-Tree is efficient and can discover numerous interesting periodic frequent patterns of metro passengers in the real-world dataset.</p></div>","PeriodicalId":52282,"journal":{"name":"International Journal of Transportation Science and Technology","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2046043023000242/pdfft?md5=d19c7c58f05bff921a0a74d2418d33c8&pid=1-s2.0-S2046043023000242-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Transportation Science and Technology","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2046043023000242","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"TRANSPORTATION","Score":null,"Total":0}
引用次数: 0

Abstract

Periodic frequent pattern discovery is a non-trivial task to discover frequent patterns based on user interests using a periodicity measure. Although conventional algorithms for periodic frequent pattern detection have numerous applications, there is still little research on periodic frequent pattern detection of individual passengers in the metro. The travel behavior of individual passengers has complex spatio-temporal characteristics in the metro network, which may pose new challenges in discovering periodic frequent patterns of individual metro passengers and developing mining algorithms based on real-world smart card data. This study addresses these issues by proposing a novel pattern for metro passenger travel pattern called periodic frequent passenger traffic patterns with time granularities and station attributes (PFPTS). This discovered pattern can automatically capture the features of the temporal dimension (morning and evening peak hours, week) and the spatial dimension (entering and leaving stations). The corresponding complete mining algorithm with the PFPTS-tree structure has been developed. To evaluate the performance of PFPTS-tree, several experiments are conducted on one-year real-world smart card data collected by an automatic fare collection system in a certain large metro network. The results show that PFPTS-Tree is efficient and can discover numerous interesting periodic frequent patterns of metro passengers in the real-world dataset.

考虑不同的时间粒度和车站属性,发现地铁乘客的周期性频繁出行模式
周期性频繁模式发现是一项非同小可的任务,它利用周期性度量来发现基于用户兴趣的频繁模式。虽然传统的周期性频繁模式检测算法应用广泛,但针对地铁中单个乘客的周期性频繁模式检测研究仍然很少。单个乘客的出行行为在地铁网络中具有复杂的时空特征,这对发现地铁单个乘客的周期性频繁模式和开发基于真实世界智能卡数据的挖掘算法提出了新的挑战。为解决这些问题,本研究提出了一种新的地铁乘客出行模式,即具有时间粒度和车站属性的周期性频繁乘客交通模式(PFPTS)。这种新发现的模式可以自动捕捉时间维度(早晚高峰时段、周)和空间维度(进站和出站)的特征。相应的具有 PFPTS 树结构的完整挖掘算法也已开发出来。为了评估 PFPTS-tree 的性能,我们在某大型地铁网络自动售检票系统收集的一年真实智能卡数据上进行了多次实验。结果表明,PFPTS-树是高效的,它能发现现实世界数据集中大量有趣的地铁乘客周期性频繁模式。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Transportation Science and Technology
International Journal of Transportation Science and Technology Engineering-Civil and Structural Engineering
CiteScore
7.20
自引率
0.00%
发文量
105
审稿时长
88 days
×
引用
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学术官方微信