24 March 2021 in IEEE Transactions on Evolutionary Computation
Evolutionary multitask optimization (EMTO) has recently attracted widespread attention in the evolutionary computation community, which solves two or more tasks simultaneously to improve the convergence characteristics of tasks when individually optimized. Effective knowledge between tasks is transferred by taking advantage of the parallelism of population-based search. Without any prior knowledge about tasks, it is a challenging problem of how to adaptively transfer effective knowledge between tasks and reduce the impact of negative transfer in EMTO. However, these two issues are rarely studied simultaneously in the existing literature. Besides, in complex many-task environments, the potential relationships among individuals from highly diverse populations associated with tasks directly determine the effectiveness of cross-task knowledge transfer. Keeping those in mind, we propose a multitask evolutionary algorithm based on anomaly detection (MTEA-AD). Specifically, each task is assigned a population and an anomaly detection model. Each anomaly detection model is used to learn the relationship among individuals between the current task and the other tasks online. Individuals that may carry negative knowledge are identified as outliers, and candidate transferred individuals identified by the anomaly detection model are selected to assist the current task, which may carry common knowledge across the current task and other tasks. Furthermore, to realize the adaptive control of the degree of knowledge transfer, the successfully transferred individuals that survive to the next generation through the elitism are used to update the anomaly detection parameter. The fair competition between offspring and candidate transferred individuals can effectively reduce the risk of negative transfer. Finally, the empirical studies on a series of synthetic benchmarks and a practical study are conducted to verify the effectiveness of MTEA-AD. The experimental results demonstrate that our proposal can adaptively adjust the degree of knowledge transfer through the anomaly detection model to achieve highly competitive performance compared to several state-of-the-art EMTO methods.
22 March 2023 in Knowledge-Based Systems
2 December 2019 in IEEE Transactions on Fuzzy Systems
The problem of time series prediction based on fuzzy cognitive maps (FCMs) is unresolved. Although many methods have been proposed to cope with this issue, the performance of these methods is far from satisfactory. Traditional FCM-based predictors have three limitations. First, current feature extraction operators are incapable of learning good representations of original time series. Second, current methods use just the output of FCMs to predict the next value; they do not directly utilize the important information of the latent features. Third, current FCM-based predictors optimize each component individually, thereby leading to low prediction accuracy. For example, these methods first optimize the feature extraction operator and then learn the FCMs from the latent features; they do not simultaneously optimize the whole prediction model. In this paper, we develop a framework based on a sparse autoencoder (SAE) and a high-order FCM (HFCM) to address the time series prediction problem; we refer this framework as SAE-FCM. To overcome the first limitation of current methods, an SAE is employed to extract features from original time series. Unlike current FCM-based predictors, our method combines the output of both an SAE and an HFCM to calculate the predicted value, thereby overcoming the second limitation of traditional FCM-based predictors. In an application of the idea of “fine-tuning” in deep learning, the weights of SAE-FCM can be updated by the batch gradient descent method if the prediction errors are great. Thus, we can optimize SAE-FCM as a whole and overcome the third limitation. We validate the performance of SAE-FCM on ten datasets. Compared with the experimental results obtained by using state-of-the-art methods, the experimental results obtained by using SAE-FCM demonstrate the effectiveness of our method. Extensive experiments also show that SAE-FCM can effectively overcome the above limitations.
29 May 2020 in IEEE Transactions on Fuzzy Systems
Fuzzy cognitive maps (FCMs) have been successfully applied to time series forecasting. However, it still remains challenging to handle multivariate long nonstationary time series, such as EEG data, which may change rapidly and have patterns of trend. To overcome this limitation, in this article, we propose a fast prediction model to deal with multivariate long nonstationary time series based on the combination of elastic net and high order fuzzy cognitive map (HFCM), which is termed as ElasticNet HFCM . The designed FCM models each variable by one node and the high-order FCM helps to capture the patterns of trend. A case study on predicting human actions through the Electroencephalogram (EEG) data in the form of multichannel long nonstationary time series is investigated based on the proposed prediction model. Specifically, we first predict EEG signals based on the historical data, then a 1D-convolutionary neural network (1D-CNN) is developed to classify the predicted time series. The experimental results on the Grasp-and-Lift dataset show that the proposal can predict the EEG data with lower prediction error compared with the other regression methods. The area under the curve scores obtained on the Grasp-and-Lift dataset by 1D-CNN are higher than those obtained by state-of-the-art classification methods for EEG data in most cases. These results illustrate that the proposal can predict and classify multivariate long nonstationary time series with high accuracy and efficiency.
17 August 2017 in IEEE Transactions on Fuzzy Systems
Learning large-scale sparse fuzzy cognitive maps (FCMs) from observed data automatically without any prior knowledge remains an outstanding problem. Most existing methods are slow and have difficulty in dealing with large-scale FCMs, because of the large searching space. We develop a framework based on compressed sensing (CS), a convex optimization method, to learn large-scale sparse FCMs, called CS-FCM. Combining with the sparsity of FCMs, the task of learning FCMs is first decomposed into sparse signal reconstruction problems. The ability of CS to exactly recover the sparse signals provides CS-FCM the probability to exactly learn FCMs. In the experiments, CS-FCM is applied to learn both synthetic data with varying sizes and densities and real-life data. The results show that CS-FCM obtains good performance by just learning from a small amount of data. CS-FCM can effectively learn sparse FCMs with 1000 nodes and even more, which have one million weights to be determined. CS-FCM is also applied to reconstruct gene regulatory networks (GRNs), and the well-known benchmark datasets DREAM3 and DREAM4 are tested. The results show that CS-FCM also obtains high accuracy in reconstructing GRNs. CS-FCM establishes a paradigm for learning large-scale sparse FCMs with high accuracy.
16 July 2021 in IEEE Transactions on Cybernetics
Due to the multilayer nature of real-world systems, the problem of inferring multilayer network structures from nonlinear and complex dynamical systems is prominent in many fields, including engineering, biological, physical, and computer sciences. Many network reconstruction methods have been proposed to address this problem, but none of them consider the similarities among network reconstruction tasks at different component layers, which are inspired by topology correlations and dynamic couplings among different component layers. This article develops an evolutionary multitasking multilayer network reconstruction framework to make use of the correlations among different component layers to improve the reconstruction performance; we refer to this framework as EM2MNR. In EM2MNR, the multilayer network reconstruction problem is first established as a multitasking multilayer network reconstruction problem, where the goal of each task is to reconstruct the network structure of a component layer. In addition, multitasking multilayer network reconstruction problems are high dimensional, but existing evolutionary multitasking algorithms may have poor performance when dealing with optimization problems with a high-dimensional search space. Inspired by the sparsity of multilayer networks, EM2MNR employs the restricted Boltzmann machine to extract low effective features from the original decision space and then decides whether to conduct knowledge transfer on these features. To verify the performance of EM2MNR, this article also designs a test suite for multilayer network reconstruction problems. The experimental results demonstrate the significant improvement obtained by the proposed EM2MNR framework on 96 multilayer network reconstruction problems.