Co-occurrence order-preserving pattern mining with keypoint alignment for time series

IF 2.5 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS ACM Transactions on Management Information Systems Pub Date : 2024-04-13 DOI:10.1145/3658450
Youxi Wu, Zhen Wang, Yan Li, Ying Guo, He Jiang, Xingquan Zhu, Xindong Wu
{"title":"Co-occurrence order-preserving pattern mining with keypoint alignment for time series","authors":"Youxi Wu, Zhen Wang, Yan Li, Ying Guo, He Jiang, Xingquan Zhu, Xindong Wu","doi":"10.1145/3658450","DOIUrl":null,"url":null,"abstract":"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 paper 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.","PeriodicalId":45274,"journal":{"name":"ACM Transactions on Management Information Systems","volume":null,"pages":null},"PeriodicalIF":2.5000,"publicationDate":"2024-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Transactions on Management Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3658450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

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 paper 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用关键点对齐进行时间序列的共现保序模式挖掘
最近,有人提出了 "保序模式(OPP)挖掘 "来发现一些模式,这些模式可以看作是时间序列中的趋势变化。虽然现有的 OPP 挖掘算法性能令人满意,但它们发现的都是频繁模式。然而,在某些情况下,用户会关注某一特定趋势及其相关趋势。为了有效发现与特定前缀模式相关的趋势信息,本文针对共现 OPP 挖掘(COP)问题,提出了一种名为 COP-Miner 的算法,用于从历史时间序列中发现 COP。COP-Miner 包括三个部分:提取关键点、准备阶段和迭代计算支持度并挖掘频繁 COP。提取关键点用于获取模式和时间序列的局部极值点。准备阶段旨在为第一轮挖掘做准备,包括四个步骤:获取关键点子时间序列的后缀 OPP、计算后缀 OPP 的出现率、验证关键点子时间序列的出现率、计算关键点子时间序列所有融合模式的出现率。为了进一步提高支持计算的效率,我们提出了一种带有结束策略的支持计算方法,即利用前缀和后缀模式的出现率来计算超模式的出现率。实验结果表明,COP-Miner 在运行时间和可扩展性方面都优于其他竞争算法。此外,具有关键点对齐功能的 COP 能产生更好的预测性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ACM Transactions on Management Information Systems
ACM Transactions on Management Information Systems COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
6.30
自引率
20.00%
发文量
60
期刊最新文献
Interpretable Predictive Models for Healthcare via Rational Multi-Layer Perceptrons Mining Multimorbidity Trajectories and Co-Medication Effects from Patient Data to Predict Post–Hip Fracture Outcomes ShennongMGS: An LLM-based Chinese Medication Guidance System Co-occurrence order-preserving pattern mining with keypoint alignment for time series Estimating Future Financial Development of Urban Areas for Deploying Bank Branches: A Local-Regional Interpretable Model
×
引用
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