首页> 外文会议>Asia-Pacific World Congress on Computer Science and Engineering >Combinational Problem Decomposition Method for Cooperative Coevolution of Recurrent Networks for Time Series Prediction
【24h】

Combinational Problem Decomposition Method for Cooperative Coevolution of Recurrent Networks for Time Series Prediction

机译:用于时间序列预测的递归网络协同协作的组合问题分解方法

获取原文
获取外文期刊封面目录资料

摘要

The breaking down of a particular problem through problem decomposition has enabled complex problems to be solved efficiently. The two major problem decomposition methods used in cooperative coevolution are synapse and neuron level. The combination of both the problem decomposition as a hybrid problem decomposition has been seen applied in time series prediction. The different problem decomposition methods applied at particular area of a network can share its strengths to solve the problem better, which forms the major motivation. In this paper, we are proposing a combination utilization of two hybrid problem decomposition method for Elman recurrent neural networks and applied to time series prediction. The results reveal that the proposed method has got better results in some datasets when compared to its standalone methods. The results are better in selected cases for proposed method when compared to several other approaches from the literature.
机译:通过问题分解分解特定问题,可以有效解决复杂的问题。协同协同进化中使用的两个主要问题分解方法是突触和神经元水平。已经看到将两种问题分解的组合作为混合问题分解应用于时间序列预测中。应用于网络特定区域的不同问题分解方法可以共享其优势,以更好地解决问题,这构成了主要动机。在本文中,我们提出两种混合问题分解方法在Elman递归神经网络中的组合利用,并应用于时间序列预测。结果表明,与独立方法相比,该方法在某些数据集中具有更好的效果。与文献中的其他几种方法相比,在某些情况下对于拟议方法而言,结果更好。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号