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.