Yan Li, Chenyu Ma, Rong Gao, Youxi Wu, Jinyan Li, Wenjian Wang, Xindong Wu
{"title":"Order-preserving pattern mining with forgetting mechanism","authors":"Yan Li, Chenyu Ma, Rong Gao, Youxi Wu, Jinyan Li, Wenjian Wang, Xindong Wu","doi":"arxiv-2408.15563","DOIUrl":null,"url":null,"abstract":"Order-preserving pattern (OPP) mining is a type of sequential pattern mining\nmethod in which a group of ranks of time series is used to represent an OPP.\nThis approach can discover frequent trends in time series. Existing OPP mining\nalgorithms consider data points at different time to be equally important;\nhowever, newer data usually have a more significant impact, while older data\nhave a weaker impact. We therefore introduce the forgetting mechanism into OPP\nmining to reduce the importance of older data. This paper explores the mining\nof OPPs with forgetting mechanism (OPF) and proposes an algorithm called\nOPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks,\ncandidate pattern generation and support calculation. In candidate pattern\ngeneration, OPF-Miner employs a maximal support priority strategy and a group\npattern fusion strategy to avoid redundant pattern fusions. For support\ncalculation, we propose an algorithm called support calculation with forgetting\nmechanism, which uses prefix and suffix pattern pruning strategies to avoid\nredundant support calculations. The experiments are conducted on nine datasets\nand 12 alternative algorithms. The results verify that OPF-Miner is superior to\nother competitive algorithms. More importantly, OPF-Miner yields good\nclustering performance for time series, since the forgetting mechanism is\nemployed. All algorithms can be downloaded from\nhttps://github.com/wuc567/Pattern-Mining/tree/master/OPF-Miner.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"61 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-28","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-2408.15563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Order-preserving pattern (OPP) mining is a type of sequential pattern mining
method in which a group of ranks of time series is used to represent an OPP.
This approach can discover frequent trends in time series. Existing OPP mining
algorithms consider data points at different time to be equally important;
however, newer data usually have a more significant impact, while older data
have a weaker impact. We therefore introduce the forgetting mechanism into OPP
mining to reduce the importance of older data. This paper explores the mining
of OPPs with forgetting mechanism (OPF) and proposes an algorithm called
OPF-Miner that can discover frequent OPFs. OPF-Miner performs two tasks,
candidate pattern generation and support calculation. In candidate pattern
generation, OPF-Miner employs a maximal support priority strategy and a group
pattern fusion strategy to avoid redundant pattern fusions. For support
calculation, we propose an algorithm called support calculation with forgetting
mechanism, which uses prefix and suffix pattern pruning strategies to avoid
redundant support calculations. The experiments are conducted on nine datasets
and 12 alternative algorithms. The results verify that OPF-Miner is superior to
other competitive algorithms. More importantly, OPF-Miner yields good
clustering performance for time series, since the forgetting mechanism is
employed. All algorithms can be downloaded from
https://github.com/wuc567/Pattern-Mining/tree/master/OPF-Miner.