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.

翻译：保序模式挖掘是一种序列模式挖掘方法，其使用时间序列的秩次组来表示保序模式。该方法能够发现时间序列中的频繁趋势。现有保序模式挖掘算法认为不同时间点的数据点具有同等重要性；然而，较新的数据通常具有更显著的影响，而较旧数据的影响则较弱。因此，我们在保序模式挖掘中引入遗忘机制，以降低旧数据的重要性。本文探讨了基于遗忘机制的保序模式挖掘问题，并提出了一种名为OPF-Miner的算法，该算法能够发现频繁的基于遗忘机制的保序模式。OPF-Miner执行两项任务：候选模式生成与支持度计算。在候选模式生成中，OPF-Miner采用最大支持度优先策略和组模式融合策略，以避免冗余的模式融合。对于支持度计算，我们提出了一种名为"基于遗忘机制的支持度计算"算法，该算法利用前缀与后缀模式剪枝策略来避免冗余的支持度计算。实验在九个数据集和十二种对比算法上进行。结果验证了OPF-Miner优于其他竞争算法。更重要的是，由于采用了遗忘机制，OPF-Miner在时间序列聚类任务中表现出良好的性能。所有算法均可从 https://github.com/wuc567/Pattern-Mining/tree/master/OPF-Miner 下载。