Dynamic Periodic Event Graphs for multivariate time series pattern prediction.

IF 3.5 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
PeerJ Computer Science Pub Date : 2025-02-24 eCollection Date: 2025-01-01 DOI:10.7717/peerj-cs.2717
SoYoung Park, HyeWon Lee, Sungsu Lim
{"title":"Dynamic Periodic Event Graphs for multivariate time series pattern prediction.","authors":"SoYoung Park, HyeWon Lee, Sungsu Lim","doi":"10.7717/peerj-cs.2717","DOIUrl":null,"url":null,"abstract":"<p><p>Understanding and predicting outcomes in complex real-world systems necessitates robust multivariate time series pattern analysis. Advanced techniques, such as dynamic graph neural networks, have shown significant efficacy for these tasks. However, existing approaches often overlook the inherent periodicity in data, leading to reduced pattern or event prediction accuracy, especially in periodic time series. We introduce a new method, called dynamic Periodic Event Graphs (PEGs), to tackle this challenge. The proposed method involves time series decomposition to extract seasonal components that capture periodically recurring patterns within the data. It also uses frequency analysis to extract representative periods from each seasonal component. Additionally, motif patterns, which are recurring sub-sequences in the time series data, are extracted. These motifs are used to define event nodes using the representative periods extracted from the seasonal components. By constructing periodic motif pattern-based dynamic bipartite event graphs, we specifically aim to enhance the performance of link prediction tasks, leveraging periodic characteristics in multivariate time series data. Our method has been rigorously tested on multiple periodic multivariate time series datasets, demonstrating over a 5% improvement in link prediction performance for both transductive and inductive scenarios. This demonstrates a substantial enhancement in predictive accuracy and generalization, providing confidence in the technique's effectiveness. Reproducibility is ensured through publicly available source code, enabling future research and applications.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"11 ","pages":"e2717"},"PeriodicalIF":3.5000,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11888914/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.2717","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Understanding and predicting outcomes in complex real-world systems necessitates robust multivariate time series pattern analysis. Advanced techniques, such as dynamic graph neural networks, have shown significant efficacy for these tasks. However, existing approaches often overlook the inherent periodicity in data, leading to reduced pattern or event prediction accuracy, especially in periodic time series. We introduce a new method, called dynamic Periodic Event Graphs (PEGs), to tackle this challenge. The proposed method involves time series decomposition to extract seasonal components that capture periodically recurring patterns within the data. It also uses frequency analysis to extract representative periods from each seasonal component. Additionally, motif patterns, which are recurring sub-sequences in the time series data, are extracted. These motifs are used to define event nodes using the representative periods extracted from the seasonal components. By constructing periodic motif pattern-based dynamic bipartite event graphs, we specifically aim to enhance the performance of link prediction tasks, leveraging periodic characteristics in multivariate time series data. Our method has been rigorously tested on multiple periodic multivariate time series datasets, demonstrating over a 5% improvement in link prediction performance for both transductive and inductive scenarios. This demonstrates a substantial enhancement in predictive accuracy and generalization, providing confidence in the technique's effectiveness. Reproducibility is ensured through publicly available source code, enabling future research and applications.

求助全文
约1分钟内获得全文 求助全文
来源期刊
PeerJ Computer Science
PeerJ Computer Science Computer Science-General Computer Science
CiteScore
6.10
自引率
5.30%
发文量
332
审稿时长
10 weeks
期刊介绍: PeerJ Computer Science is the new open access journal covering all subject areas in computer science, with the backing of a prestigious advisory board and more than 300 academic editors.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信