Time series forecasting based on complex network in weighted node similarity

• URL: http://arxiv.org/abs/2103.13870v2
• Date: Fri, 26 Mar 2021 01:11:32 GMT
• Title: Time series forecasting based on complex network in weighted node similarity
• Authors: Tianxiang Zhan, Fuyuan Xiao
• Abstract summary: In time series analysis, visibility graph theory transforms time series data into a network model. The node similarity index is used as the weight coefficient to optimize the prediction algorithm. The method has more accurate forecasting ability and can provide more accurate forecasts in the field of time series and actual scenes.
• Score: 12.246860992135783
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Time series have attracted widespread attention in many fields today. Based on the analysis of complex networks and visibility graph theory, a new time series forecasting method is proposed. In time series analysis, visibility graph theory transforms time series data into a network model. In the network model, the node similarity index is an important factor. On the basis of directly using the node prediction method with the largest similarity, the node similarity index is used as the weight coefficient to optimize the prediction algorithm. Compared with the single-point sampling node prediction algorithm, the multi-point sampling prediction algorithm can provide more accurate prediction values when the data set is sufficient. According to results of experiments on four real-world representative datasets, the method has more accurate forecasting ability and can provide more accurate forecasts in the field of time series and actual scenes.

Related papers

• FourierGNN: Rethinking Multivariate Time Series Forecasting from a Pure Graph Perspective [48.00240550685946]
  Current state-of-the-art graph neural network (GNN)-based forecasting methods usually require both graph networks (e.g., GCN) and temporal networks (e.g., LSTM) to capture inter-series (spatial) dynamics and intra-series (temporal) dependencies, respectively. We propose a novel Fourier Graph Neural Network (FourierGNN) by stacking our proposed Fourier Graph Operator (FGO) to perform matrix multiplications in Fourier space. Our experiments on seven datasets have demonstrated superior performance with higher efficiency and fewer parameters compared with state-of-the-
  arXiv  Detail & Related papers  (2023-11-10T17:13:26Z)
• Respecting Time Series Properties Makes Deep Time Series Forecasting Perfect [3.830797055092574]
  How to handle time features shall be the core question of any time series forecasting model. In this paper, we rigorously analyze three prevalent but deficient/unfounded deep time series forecasting mechanisms. We propose a novel time series forecasting network, i.e. RTNet, on the basis of aforementioned analysis.
  arXiv  Detail & Related papers  (2022-07-22T08:34:31Z)
• Cluster-and-Conquer: A Framework For Time-Series Forecasting [94.63501563413725]
  We propose a three-stage framework for forecasting high-dimensional time-series data. Our framework is highly general, allowing for any time-series forecasting and clustering method to be used in each step. When instantiated with simple linear autoregressive models, we are able to achieve state-of-the-art results on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T20:41:19Z)
• Novel Features for Time Series Analysis: A Complex Networks Approach [62.997667081978825]
  Time series data are ubiquitous in several domains as climate, economics and health care. Recent conceptual approach relies on time series mapping to complex networks. Network analysis can be used to characterize different types of time series.
  arXiv  Detail & Related papers  (2021-10-11T13:46:28Z)
• Probabilistic Time Series Forecasting with Implicit Quantile Networks [0.7249731529275341]
  We combine an autoregressive recurrent neural network to model temporal dynamics with Implicit Quantile Networks to learn a large class of distributions over a time-series target. Our approach is favorable in terms of point-wise prediction accuracy as well as on estimating the underlying temporal distribution.
  arXiv  Detail & Related papers  (2021-07-08T10:37:24Z)
• Predicting traffic signals on transportation networks using spatio-temporal correlations on graphs [56.48498624951417]
  This paper proposes a traffic propagation model that merges multiple heat diffusion kernels into a data-driven prediction model to forecast traffic signals. We optimize the model parameters using Bayesian inference to minimize the prediction errors and, consequently, determine the mixing ratio of the two approaches. The proposed model demonstrates prediction accuracy comparable to that of the state-of-the-art deep neural networks with lower computational effort.
  arXiv  Detail & Related papers  (2021-04-27T18:17:42Z)
• FlashP: An Analytical Pipeline for Real-time Forecasting of Time-Series Relational Data [31.29499654765994]
  Real-time forecasting can be conducted in two steps: first, we specify the part of data to be focused on and the measure to be predicted by slicing, dicing, and aggregating the data. A natural idea is to utilize sampling to obtain approximate aggregations in real time as the input to train the forecasting model. We introduce a new sampling scheme, called GSW sampling, and analyze error bounds for estimating aggregations using GSW samples.
  arXiv  Detail & Related papers  (2021-01-09T06:23:13Z)
• Prediction of hierarchical time series using structured regularization and its application to artificial neural networks [4.696083734269231]
  We discuss the prediction of hierarchical time series, where each upper-level time series is calculated by summing appropriate lower-level time series. Forecasts for such hierarchical time series should be coherent, meaning that the forecast for an upper-level time series equals the sum of forecasts for corresponding lower-level time series.
  arXiv  Detail & Related papers  (2020-07-30T00:30:32Z)
• Predicting Temporal Sets with Deep Neural Networks [50.53727580527024]
  We propose an integrated solution based on the deep neural networks for temporal sets prediction. A unique perspective is to learn element relationship by constructing set-level co-occurrence graph. We design an attention-based module to adaptively learn the temporal dependency of elements and sets.
  arXiv  Detail & Related papers  (2020-06-20T03:29:02Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)
• A clustering approach to time series forecasting using neural networks: A comparative study on distance-based vs. feature-based clustering methods [1.256413718364189]
  We propose various neural network architectures to forecast the time series data using the dynamic measurements. We also investigate the importance of performing techniques such as anomaly detection and clustering on forecasting accuracy. Our results indicate that clustering can improve the overall prediction time as well as improve the forecasting performance of the neural network.
  arXiv  Detail & Related papers  (2020-01-27T00:31:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.