GraFITi: Graphs for Forecasting Irregularly Sampled Time Series

被引:0
|
作者
Yalavarthi, Vijaya Krishna [1 ]
Madhusudhanan, Kiran [1 ]
Scholz, Randolf [1 ]
Ahmed, Nourhan [1 ]
Burchert, Johannes [1 ]
Jawed, Shayan [1 ]
Born, Stefan [2 ]
Schmidt-Thieme, Lars [1 ]
机构
[1] Univ Hildesheim, Informat Syst & Machine Learning Lab ISMLL, Hildesheim, Germany
[2] TU Berlin, Inst Math, Berlin, Germany
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Forecasting irregularly sampled time series with missing values is a crucial task for numerous real-world applications such as healthcare, astronomy, and climate sciences. Stateof-the-art approaches to this problem rely on Ordinary Differential Equations (ODEs) which are known to be slow and often require additional features to handle missing values. To address this issue, we propose a novel model using Graphs for Forecasting Irregularly Sampled Time Series with missing values which we call GraFITi. GraFITi first converts the time series to a Sparsity Structure Graph which is a sparse bipartite graph, and then reformulates the forecasting problem as the edge weight prediction task in the graph. It uses the power of Graph Neural Networks to learn the graph and predict the target edge weights. GraFITi has been tested on 3 real-world and 1 synthetic irregularly sampled time series dataset with missing values and compared with various state-of-the-art models. The experimental results demonstrate that GraFITi improves the forecasting accuracy by up to 17% and reduces the run time up to 5 times compared to the state-of-the-art forecasting models.
引用
收藏
页码:16255 / 16263
页数:9
相关论文
共 50 条
  • [1] Functional Latent Dynamics for Irregularly Sampled Time Series Forecasting
    Kloetergens, Christian
    Yalavarthi, Vijaya Krishna
    Stubbemann, Maximilian
    Schmidt-Thieme, Lars
    [J]. MACHINE LEARNING AND KNOWLEDGE DISCOVERY IN DATABASES: RESEARCH TRACK, PT IV, ECML PKDD 2024, 2024, 14944 : 421 - 436
  • [2] Sparsity-Invariant Convolution for Forecasting Irregularly Sampled Time Series
    Buza, Krisztian
    [J]. COMPUTATIONAL COLLECTIVE INTELLIGENCE, ICCCI 2023, 2023, 14162 : 151 - 162
  • [3] On the reconstruction of irregularly sampled time series
    Vio, R
    Strohmer, T
    Wamsteker, W
    [J]. PUBLICATIONS OF THE ASTRONOMICAL SOCIETY OF THE PACIFIC, 2000, 112 (767) : 74 - 90
  • [4] Detecting chaos in irregularly sampled time series
    Kulp, C. W.
    [J]. CHAOS, 2013, 23 (03)
  • [5] Time Series as Images: Vision Transformer for Irregularly Sampled Time Series
    Li, Zekun
    Li, Shiyang
    Yan, Xifeng
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,
  • [6] Time pattern reconstruction for classification of irregularly sampled time series
    Sun, Chenxi
    Li, Hongyan
    Song, Moxian
    Cai, Derun
    Zhang, Baofeng
    Hong, Shenda
    [J]. PATTERN RECOGNITION, 2024, 147
  • [7] Time pattern reconstruction for classification of irregularly sampled time series
    Sun, Chenxi
    Li, Hongyan
    Song, Moxian
    Cai, Derun
    Zhang, Baofeng
    Hong, Shenda
    [J]. Pattern Recognition, 2024, 147
  • [8] Tests of irregularly sampled stochastic time series for AGN
    Vio, R
    Wamsteker, W
    [J]. ASTRONOMICAL TIME SERIES, 1997, 218 : 167 - 170
  • [9] Compatible Transformer for Irregularly Sampled Multivariate Time Series
    Wei, Yuxi
    Peng, Juntong
    He, Tong
    Xu, Chenxin
    Zhang, Jian
    Pan, Shirui
    Chen, Siheng
    [J]. arXiv, 2023,
  • [10] Latent ODEs for Irregularly-Sampled Time Series
    Rubanova, Yulia
    Chen, Ricky T. Q.
    Duvenaud, David
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 32 (NIPS 2019), 2019, 32