Recurrent type-1 fuzzy functions approach for time series forecasting

Creative Commons License


APPLIED INTELLIGENCE, vol.48, no.1, pp.68-77, 2018 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 48 Issue: 1
  • Publication Date: 2018
  • Doi Number: 10.1007/s10489-017-0962-8
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.68-77
  • Keywords: Type-1 fuzzy functions, Nonlinear time series, Forecasting, Autoregressive model, Moving average model, Particle swarm optimization, PARTICLE SWARM OPTIMIZATION, NEURAL-NETWORK MODEL, SUPPORT VECTOR MACHINES, HYBRID ARIMA, ENROLLMENTS, PREDICTION, ALGORITHM, SYSTEMS, ANFIS
  • Yıldız Technical University Affiliated: Yes


Forecasting the future values of a time series is a common research topic and is studied using probabilistic and non-probabilistic methods. For probabilistic methods, the autoregressive integrated moving average and exponential smoothing methods are commonly used, whereas for non-probabilistic methods, artificial neural networks and fuzzy inference systems (FIS) are commonly used. There are numerous FIS methods. While most of these methods are rule-based, there are a few methods that do not require rules, such as the type-1 fuzzy function (T1FF) approach. While it is possible to encounter a method such as an autoregressive (AR) model integrated with a T1FF, no method that includes T1FF and the moving average (MA) model in one algorithm has yet been proposed. The aim of this study is to improve forecasting by taking the disturbance terms into account. The input dataset is organized using the following variables. First, the lagged values of the time series are used for the AR model. Second, a fuzzy c-means clustering algorithm is used to cluster the inputs. Third, for the MA, the residuals of fuzzy functions are used. Hence, AR, MA, and the degree of memberships of the objects are included in the input dataset. Because the objective function is not derivative, particle swarm optimization is preferable for solving it. The results on several datasets show that the proposed method outperforms most of the methods in literature.