An Efficient Network Method for Time Series Forecasting Based on the DC Algorithm and Visibility Relation

Recently time series prediction based on network analysis has become a hot research topic. However, how to more accurately forecast time series with good efficiency is still an open question. To address this issue, we propose an efficient time series forecasting method based on the DC algorithm and visibility relations on the vertexes set. Firstly, the time series is mapped into the network by the DC algorithm, which is a more efficient approach to generate the visibility graph. Then, we use the variation trends (slope) of those nodes that have visibility relation with the last node to get the preliminary predictive values. Afterward, the value of the last node is adopted to obtain the revised predictive values, which are assigned different weights according to node degree and time distance to get the final weighted result. To better demonstrate the prediction performance and applicability of the proposed method, the proposed method is applied to different time series data sets. The empirical results show that the proposed method could provide a higher level of forecasting accuracy than many methods with relatively lower time complexity.

Abstract licence: CC BY-NC-ND

65 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.