Elsevier

Knowledge-Based Systems

Volume 206, 28 October 2020, 106359
Knowledge-Based Systems

Time series forecasting based on kernel mapping and high-order fuzzy cognitive maps

https://doi.org/10.1016/j.knosys.2020.106359Get rights and content

Abstract

Fuzzy cognitive maps (FCMs) have emerged as a powerful tool for dealing with the task of time series prediction. Most existing research devoted to designing an effective method to extract feature time series from the original time series, which are used to construct FCMs and predict the time series. However, in existing methods, all extracted feature time series, including the redundant feature time series, were used to develop FCMs instead of selecting the key feature time series (KFTS) to construct FCMs, which limits the generalization and prediction accuracy of the models. In this paper, we propose a framework based on kernel mapping and high-order FCMs (HFCM) to forecast time series inspired by the kernel methods and support vector regression (SVR). The model is termed as Kernel-HFCM. Kernel mapping is designed to map the original one-dimensional time series into multidimensional feature time series, and then the feature selection algorithm is proposed to select the KFTS from the multidimensional feature time series to develop the HFCM. Finally, reverse kernel mapping is used to map the feature time series back to the predicted one-dimensional time series. In comparison to the existing methods, the experimental results on seven benchmark datasets demonstrate the effectiveness of Kernel-HFCM in time series prediction.

Introduction

Fuzzy cognitive maps (FCMs) [1], the powerful fuzzy models inheriting the main attributes of fuzzy logic and neural networks, are effective for simulating and modeling complex systems. FCMs are made up of vertices and directed weight edges connecting the vertices. The vertices in FCMs are utilized to represent real-world concepts, and the directed weight edges denote the relations between the vertices. FCMs possess advantages in terms of the fast numerical reasoning ability, good interpretability, and intuitive knowledge representation, and thus have wide applications in multiple fields, including disorder diagnosis and classification [2], decision making [3], [4], time series modeling [5], and time series prediction [6], [7]. Time series is simply a series of data points ordered in time, such as. Time series prediction is the use of models to predict the future value of lt+1 based on the observed historical time series. Accurate time series forecasting is of great significance in finance, economy, environmental protection, and agriculture, etc. Thus, numerous algorithms based on FCMs were designed to model and predict time series. Overall, the feature time series were extracted from the original time series to develop FCMs [8], [9], [10], [11], [12]. Then parameter optimization methods were used to learn FCMs. Over the past years, many parameter optimization algorithms have been proposed to develop the FCMs, such as Hebbian rule [13], particle swarm optimization (PSO) [14], real coded genetic algorithm (RCGA) [15], modified asexual reproduction optimization (MARO) [16], and imperialist competitive learning algorithm (ICLA) [17]. Given the definition of FCMs, their dynamics are of the first-order, meaning that the next state depends upon the one in the previous iteration, which limits the ability of FCMs to model complex systems. To enhance the modeling capabilities of FCMs, high-order FCMs (HFCM) were proposed to enhance the approximation ability of FCMs [18]. RCGA-based learning method [18] and the gradient optimization method [19] were also designed to develop the HFCM.

The kernel methods [20], [21], [22] are well-known methods for nonlinear pattern analysis, whose core idea is embedding the original data into the appropriate high-dimensional feature space by some kinds of nonlinear mapping, and then the general linear learner is used to analyze and process the pattern in this new space. The kernel methods assume that the data is nonlinearly distributed in the low-dimensional space, and the distribution is likely to be linear after being transformed into the high-dimensional feature space. Due to the powerful ability in analyzing the nonlinear pattern, the models based on the kernel methods have been used in classification [23], [24], regression [25], [26], prediction [27], [28], etc.

Although FCMs have been successfully applied to time series modeling and prediction, these FCM-based prediction models still have many shortcomings, mainly reflected in the following aspects. Existing feature time series extraction algorithms based on FCMs are not effective enough. For instance, the models in [8], [9], [10], [11], [12] transformed the original time series into fuzzy time series, which lost part of the trend, state, and spectrum features of the original time series. Therefore, the accuracy of time series prediction was insufficient. The model in [19] applied the Harr wavelet transform to extract the feature time series and the model in [29] applied the fuzzy c-means to extract the feature time series. All feature time series, including the redundant feature time series, were used to develop FCMs instead of selecting the key feature time series (KFTS) to construct FCMs, which made the model less accurate on different complex time series prediction problems. In other words, the feature time series used to develop FCMs were not representative enough.

Because of the limitations of existing FCMs-based time series prediction models, we propose a novel time series prediction framework by the hybrid combination of kernel mapping and HFCM inspired by the kernel methods and the support vector regression (SVR). The framework is termed as Kernel-HFCM. Kernel mapping is a highly effective and generalized feature time series extraction method, which is designed to embed the original one-dimensional time series into the multidimensional feature time series space, and then the feature selection algorithm is proposed to select the KFTS from the multidimensional feature time series space, and the KFTS are used to develop the structure of HFCM to model the pattern of the KFTS. After acquiring the pattern of the KFTS, the future time series values will be predicted precisely. In comparison to the existing methods, the experimental results on seven benchmark datasets demonstrate the effectiveness of our proposal in complex non-stationary time series prediction. The novelty of the proposed Kernel-HFCM is summarized as follows,

(1) Kernel-HFCM is first proposed for time series analysis inspired by the kernel methods and SVR. The experimental results validate the superiority of our framework in prediction accuracy compared with the state-of-the-art methods.

(2) The kernel mapping is proposed firstly to extract the feature time series from the original time series, and then the feature selection algorithm is designed to select the KFTS to develop the HFCM. To the best of our knowledge, feature selection is first introduced to the FCM-based time series prediction. Inheriting the properties of the kernel mapping and feature selection, Kernel-HFCM overcomes the shortcomings that the redundant feature time series were used to develop FCMs.

The rest of this paper is organized as follows: Section 2 provides an introduction on FCMs. Section 3 reviews the related work on FCMs based time series prediction. The proposed Kernel-HFCM is introduced in detail in Section 4. The experiments and discussion are given in Section 5. Finally, conclusions are given in Section 6.

Section snippets

Fuzzy cognitive maps

FCMs are models consisting of a set of conceptual nodes and fuzzy relationships between nodes, which can be presented as directed weighted graphs. Suppose the number of nodes of an FCM is Nc, then the state value vector C of conceptual nodes is defined as follows, C=C1C2CNcwhere Ci ranges in [−1, 1] (or [0, 1]), i=1,2,,Nc. The state value of each conceptual node represents the activation degree of the current node. The fuzzy relationships between nodes are defined as an Nc×Ncweight matrix W. W

Related work

Overall, the feature time series are extracted from the original time series, which are used to develop FCMs [6], such as the models in [8], [9], [10], [11], [12]. Stach et al. [8] transformed the original time series into information granules including change of the time series and amplitude of the time series, and granular time series were extracted from the information granules, which were used as the train data to construct and learn FCMs. Froelich et al. [9] proposed a new method to

Kernel-HFCM

In this section, a novel framework of time series prediction, termed as Kernel-HFCM, is introduced. Fig. 2 shows the overall framework of Kernel-HFCM. First, the original time series are normalized into the range of [0, 1] or [−1, 1]. Second, the kernel mapping is designed to map the original one-dimensional time series into the multidimensional feature time series, and then the key feature time series are selected from the multidimensional feature time series to develop the HFCM. Third, the

Datasets

Seven benchmark time series datasets are used to verify the effectiveness of our proposed Kernel-HFCM in time series prediction. All of them can be obtained from the Yahoo finance website [40]. The descriptions of the datasets are shown in Table 1.

Experimental setup

The activation function of Kernel-HFCM in this paper is set to the sigmoid function, whose output is in [0, 1]. Therefore, the original time series are normalized into the range of [0, 1] before feeding them into Kernel-HFCM. Besides, the

Conclusions

Inspired by SVR and the kernel methods, a time series prediction model named Kernel-HFCM is proposed based on the kernel mapping and the HFCM. The kernel mapping is designed to map the original one-dimensional time series to the high-dimension feature space, and then the KFTS are selected from the high-dimensional feature space to develop the HFCM. To avoid overfitting, ridge regression is applied to design the cost function. Finally, the reverse kernel mapping transforms the feature time

CRediT authorship contribution statement

Kaixin Yuan: Conceptualization, Methodology, Software, Validation, Formal analysis, Writing - original draft, Writing - review & editing. Jing Liu: Writing - review & editing, Supervision, Funding acquisition. Shanchao Yang: Writing - review & editing. Kai Wu: Writing - review & editing. Fang Shen: Writing - review & editing.

Declaration of Competing Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Acknowledgments

This work was supported in part by the Key Project of Science and Technology Innovation 2030 supported by the Ministry of Science and Technology of China under Grant 2018AAA0101302 and in part by the General Program of National Natural Science Foundation of China (NSFC) under Grant 61773300.

References (44)

  • LiuZ. et al.

    A robust time series prediction method based on empirical mode decomposition and high-order fuzzy cognitive maps

    Knowl.-Based Syst.

    (2020)
  • AmirkhaniA. et al.

    A novel hybrid method based on fuzzy cognitive maps and fuzzy clustering algorithms for grading celiac disease

    Neural Comput. Appl.

    (2018)
  • BakhtavarE. et al.

    Assessment of workplace accident risks in underground collieries by integrating a multi-goal cause-and-effect analysis method with MCDM sensitivity analysis

    Stoch. Environ. Res. Risk Assess.

    (2018)
  • PapageorgiouK. et al.

    Decision-making process for photovoltaic solar energy sector development using fuzzy cognitive map technique

    Energies

    (2020)
  • WuK. et al.

    Time series prediction using sparse autoencoder and high-order fuzzy cognitive maps

    IEEE Trans. Fuzzy Syst.

    (2020)
  • RezaeeM.J. et al.

    A decision system using fuzzy cognitive map and multi-group data envelopment analysis to estimate hospitals’ outputs level

    Neural Comput. Appl.

    (2018)
  • StachW. et al.

    Numerical and linguistic prediction of time series with the use of fuzzy cognitive maps

    IEEE Trans. Fuzzy Syst.

    (2008)
  • W. Lu, J. Yang, X. Liu, The linguistic forecasting of time series based on fuzzy cognitive maps, in: 2013 Joint IFSA...
  • E. Papageorgiou, C. Stylios, P. Groumpos, Fuzzy cognitive map learning based on nonlinear Hebbian rule, in:...
  • PapageorgiouE.I. et al.

    Fuzzy cognitive maps learning using particle swarm optimization

    J. Intell. Inf. Syst.

    (2005)
  • S. Ahmadi, S. Alizadeh, N. Forouzideh, C.-H. Yeh, R. Martin, E. Papageorgiou, ICLA imperialist competitive learning...
  • W. Stach, L. Kurgan, W. Pedrycz, Higher-order fuzzy cognitive maps, in: NAFIPS 2006-2006 Annual Meeting of the North...
  • Cited by (30)

    • Randomized high order fuzzy cognitive maps as reservoir computing models: A first introduction and applications

      2022, Neurocomputing
      Citation Excerpt :

      Therefore, evolutionary learning has been replaced with other techniques in some references. For instance, the least squares in [18], the ridge regression in [3,13,19], the Bayesian ridge regression in [20], and the Moore–Penrose inverse in [12]. In spite of the advances in training procedures, they can still be very time-consuming due to the high number of parameters that must be adjusted.

    View all citing articles on Scopus
    View full text