Efficient Rare Temporal Pattern Mining in Time Series

Van Ho Long, Nguyen Ho, Trinh Le Cong, Anh-Vu Dinh-Duc, Tu Nguyen Ngoc
{"title":"Efficient Rare Temporal Pattern Mining in Time Series","authors":"Van Ho Long, Nguyen Ho, Trinh Le Cong, Anh-Vu Dinh-Duc, Tu Nguyen Ngoc","doi":"arxiv-2409.05042","DOIUrl":null,"url":null,"abstract":"Time series data from various domains are increasing continuously. Extracting\nand analyzing the temporal patterns in these series can reveal significant\ninsights. Temporal pattern mining (TPM) extends traditional pattern mining by\nincorporating event time intervals into extracted patterns, enhancing their\nexpressiveness but increasing time and space complexities. One valuable type of\ntemporal pattern is known as rare temporal patterns (RTPs), which occur rarely\nbut with high confidence. There exist several challenges when mining rare\ntemporal patterns. The support measure is set very low, leading to a further\ncombinatorial explosion and potentially producing too many uninteresting\npatterns. Thus, an efficient approach to rare temporal pattern mining is\nneeded. This paper introduces our Rare Temporal Pattern Mining from Time Series\n(RTPMfTS) method for discovering rare temporal patterns, featuring the\nfollowing key contributions: (1) An end-to-end RTPMfTS process that takes time\nseries data as input and yields rare temporal patterns as output. (2) An\nefficient Rare Temporal Pattern Mining (RTPM) algorithm that uses optimized\ndata structures for quick event and pattern retrieval and utilizes effective\npruning techniques for much faster mining. (3) A thorough experimental\nevaluation of RTPM, showing that RTPM outperforms the baseline in terms of\nruntime and memory usage.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.05042","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Time series data from various domains are increasing continuously. Extracting and analyzing the temporal patterns in these series can reveal significant insights. Temporal pattern mining (TPM) extends traditional pattern mining by incorporating event time intervals into extracted patterns, enhancing their expressiveness but increasing time and space complexities. One valuable type of temporal pattern is known as rare temporal patterns (RTPs), which occur rarely but with high confidence. There exist several challenges when mining rare temporal patterns. The support measure is set very low, leading to a further combinatorial explosion and potentially producing too many uninteresting patterns. Thus, an efficient approach to rare temporal pattern mining is needed. This paper introduces our Rare Temporal Pattern Mining from Time Series (RTPMfTS) method for discovering rare temporal patterns, featuring the following key contributions: (1) An end-to-end RTPMfTS process that takes time series data as input and yields rare temporal patterns as output. (2) An efficient Rare Temporal Pattern Mining (RTPM) algorithm that uses optimized data structures for quick event and pattern retrieval and utilizes effective pruning techniques for much faster mining. (3) A thorough experimental evaluation of RTPM, showing that RTPM outperforms the baseline in terms of runtime and memory usage.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
时间序列中的高效罕见时态模式挖掘
来自各个领域的时间序列数据不断增加。提取和分析这些序列中的时间模式可以揭示重要信息。时态模式挖掘(TPM)是对传统模式挖掘的扩展,它将事件的时间间隔纳入到提取的模式中,从而增强了模式的表现力,但也增加了时间和空间的复杂性。罕见时间模式(RTPs)是一种有价值的时间模式,这种模式很少出现,但可信度很高。在挖掘稀有时态模式时存在几个挑战。支持度量设置得很低,会导致进一步的组合爆炸,并可能产生过多无趣的模式。因此,需要一种高效的稀有时间模式挖掘方法。本文介绍了我们发现稀有时间模式的时间序列稀有时间模式挖掘(RTPMfTS)方法,主要贡献如下:(1)端到端 RTPMfTS 流程,以时间序列数据为输入,以稀有时间模式为输出。(2) 一种高效的罕见时间模式挖掘(RTPM)算法,它使用优化的数据结构来快速检索事件和模式,并利用有效的剪枝技术来加快挖掘速度。(3) 对 RTPM 进行了全面的实验评估,结果表明 RTPM 在运行时间和内存使用方面都优于基线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Development of Data Evaluation Benchmark for Data Wrangling Recommendation System Messy Code Makes Managing ML Pipelines Difficult? Just Let LLMs Rewrite the Code! Fast and Adaptive Bulk Loading of Multidimensional Points Matrix Profile for Anomaly Detection on Multidimensional Time Series Extending predictive process monitoring for collaborative processes
×
引用
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