计算机科学
后缀
前缀
系列(地层学)
数据挖掘
可扩展性
特里亚
时间序列
后缀树
光学(聚焦)
人工智能
模式识别(心理学)
机器学习
数据结构
数据库
哲学
物理
光学
古生物学
生物
程序设计语言
语言学
作者
Youxi Wu,Zhen Wang,Yan Li,Yingchun Guo,He Jiang,Xingquan Zhu,Xindong Wu
出处
期刊:ACM transactions on management information systems
[Association for Computing Machinery]
日期:2024-04-13
卷期号:15 (2): 1-27
被引量:1
摘要
Recently, order-preserving pattern (OPP) mining has been proposed to discover some patterns, which can be seen as trend changes in time series. Although existing OPP mining algorithms have achieved satisfactory performance, they discover all frequent patterns. However, in some cases, users focus on a particular trend and its associated trends. To efficiently discover trend information related to a specific prefix pattern, this article addresses the issue of co-occurrence OPP mining (COP) and proposes an algorithm named COP-Miner to discover COPs from historical time series. COP-Miner consists of three parts: extracting keypoints, preparation stage, and iteratively calculating supports and mining frequent COPs. Extracting keypoints is used to obtain local extreme points of patterns and time series. The preparation stage is designed to prepare for the first round of mining, which contains four steps: obtaining the suffix OPP of the keypoint sub-time series, calculating the occurrences of the suffix OPP, verifying the occurrences of the keypoint sub-time series, and calculating the occurrences of all fusion patterns of the keypoint sub-time series. To further improve the efficiency of support calculation, we propose a support calculation method with an ending strategy that uses the occurrences of prefix and suffix patterns to calculate the occurrences of superpatterns. Experimental results indicate that COP-Miner outperforms the other competing algorithms in running time and scalability. Moreover, COPs with keypoint alignment yield better prediction performance.
科研通智能强力驱动
Strongly Powered by AbleSci AI