基于分数阶最大相关熵算法的混沌时间序列预测

为提高最大相关熵算法对混沌时间序列的预测速度和精度,提出了一种新的分数阶最大相关熵算法.在采用最大相关熵准则的基础上,利用分数阶微分设计了一种新的权重更新方法.在alpha噪声环境下,采用新的分数阶最大相关熵算法对Mackey-Glass和Lorenz两类具有代表性的混沌时间序列进行预测,并分析了分数阶的阶数对混沌时间序列预测性能的影响.仿真结果表明:与最小均方算法、最大相关熵算法以及分数阶最小均方算法三类自适应滤波算法相比,所提分数阶最大相关熵算法在混沌时间序列预测中能够有效地抑制非高斯脉冲噪声干扰的影响,具有较快收的敛速度和较低的稳态误差.

Prediction of chaotic time series based on the fractional-order maximum correntropy criterion algorithm

Recently, adaptive filters have been widely used to perform the prediction of chaotic time series. Generally, the Gaussian noise is considered for the system noise. However, many non-Gaussian noises, e.g., impulse noise and alpha noise, exist in real systems. Adaptive filters are therefore required to reduce such non-Gaussian noises for practical applications. For improving the robustness against non-Gaussian noise, the maximum correntropy criterion (MCC) is successfully used to derive various robust adaptive filters. In these robust adaptive filters, the steepest ascent method based on the first-order derivative is generally utilized to construct the weight update form. It is well known that the traditional derivative can be generalized by the fractional-order derivative effectively. Therefore, to further improve the performance of adaptive filters based on the MCC, the fractional-order derivative is applied to the MCC-based algorithm, generating a novel fractional-order maximum correntropy criterion (FMCC) algorithm. Under the non-Gaussian noises, the proposed FMCC algorithm can be applied to predicting the chaotic time series effectively. In the proposed FMCC algorithm, the weight update form is constructed by using a combination of the first-order derivative based term and the fractional-order derivative based term. The Riemann-Liouville definition is utilized for calculating the fractional-order derivative in the proposed FMCC algorithm. The order of the fractional-order derivative is a crucial parameter of the proposed FMCC algorithm. However, it is difficult to obtain the optimal fractional order for different nonlinear systems theoretically. Therefore, the influence of the fractional order on the prediction performance is determined by trials for different nonlinear systems. The appropriate fractional order corresponds to the optimum of prediction accuracy, and can be chosen in advance. Simulations in the context of prediction of Mackey-Glass time series and Lorenz time series demonstrate that in the case of non-Gaussian noises the proposed FMCC algorithm achieves better prediction accuracy and faster convergence rate than the least mean square (LMS) algorithm, the MCC algorithm, and the fractional-order least mean square (FLMS) algorithm. In addition, the computational complexity of different filters is compared with each other under the example of the prediction of Marckey-Glass time series by using mean consumed time. It can be found that the computational complexity of FMCC algorithm is higher than those of the MCC and the LMS algorithms, but only slightly higher than that of the FLMS algorithm. As a result, comparing with other filters, the FMCC algorithm can improve the prediction performances of chaotic time series at the cost of the increasing computational complexity.