节点文献

自适应矩估计最大相关熵算法的混沌序列预测

Prediction of Chaotic Sequence with the Adaptive Moment Estimation Algorithm Based on Maximum Correntropy Criterion

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王世元王文月钱国兵

【Author】 WANG Shiyuan;WANG Wenyue;QIAN Guobing;College of Electronic and Information Engineering//Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing,Southwest University;

【机构】 西南大学电子信息工程学院//非线性电路与智能信息处理重庆市重点实验室

【摘要】 为了提高非高斯噪声环境下混沌时间序列的预测精度,提出了一种基于自适应矩估计的最大相关熵算法(AdamMCC).在AdamMCC中,采用最大相关熵准则作为代价函数有效地抑制了异常噪声值对预测性能的影响,利用代价函数梯度的一阶矩和二阶矩估计自适应调整算法的权重参数,在不同阶段为算法提供了更好的最优权重搜索方向,从而提高了AdamMCC的预测性能.采用Mackey-Glass和Lorenz两类混沌时间序列进行仿真实验,验证文中提出的AdamMCC的收敛性能和稳态性能.实验结果表明,在非高斯环境下的预测过程中,相比于最小均方算法、最大相关熵算法和分数阶最大相关熵算法,文中提出的基于自适应矩估计的最大相关熵算法在保持鲁棒性的同时,还能以合理的计算复杂度获得更高的预测精度.

【Abstract】 A novel adaptive moment estimation algorithm based on maximum correntropy criterion(AdamMCC)was proposed to improve the prediction accuracy of chaotic sequence in the non-Gaussian noises.The maximum correntropy criterion was chosen as the cost function of the proposed AdamMCC owing to its robustness against non-Gaussian noises.The first and second moments of gradients in the cost function were used to adjust the weight of the parameters in the algorithm,which provides a better search direction for the optimal weight,thus improved the prediction performance of the proposed AdamMCC.Simulations on the prediction of the Mackey-Glass chaotic time sequence and Lorenz chaotic time sequence illustrate that the proposed AdamMCC can achieve better prediction performance with affordable computational complexity and maintain robustness,compared with the least mean square algorithm(LMS),the maximum correntropy criterion algorithm(MCC),and the fractional-order maximum correntropy criterion algorithm(FMCC)in the presence of non-Gaussian noises.

【基金】 国家自然科学基金资助项目(61671389,61701419);重庆市博士后科研项目特别资助项目(Xm2017107,Xm2017104)~~
  • 【文献出处】 华南理工大学学报(自然科学版) ,Journal of South China University of Technology(Natural Science Edition) , 编辑部邮箱 ,2019年04期
  • 【分类号】O415.5;O211.61
  • 【被引频次】8
  • 【下载频次】201
节点文献中: 

本文链接的文献网络图示:

本文的引文网络