Search

Article

x

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

Chaotic time series prediction using add-delete mechanism based regularized extreme learning machine

Zhao Yong-Ping Wang Kang-Kang

Chaotic time series prediction using add-delete mechanism based regularized extreme learning machine

Zhao Yong-Ping, Wang Kang-Kang
PDF
Get Citation

(PLEASE TRANSLATE TO ENGLISH

BY GOOGLE TRANSLATE IF NEEDED.)

Metrics
  • Abstract views:  942
  • PDF Downloads:  410
  • Cited By: 0
Publishing process
  • Received Date:  13 August 2013
  • Accepted Date:  17 September 2013
  • Published Online:  05 December 2013

Chaotic time series prediction using add-delete mechanism based regularized extreme learning machine

  • 1. School of Mechanical Engineering, Nanjing University of Science and Technology, Nanjing 210094, China
Fund Project:  Project supported by the National Natural Science Foundation of China (Grant No. 51006052) and the Outstanding Scholar Supporting Program of Nanjing Univeristy of Science and Technology, China.

Abstract: Considering a regularized extreme learning machine (RELM) with randomly generated hidden nodes, an add-delete mechanism is proposed to determine the number of hidden nodes adaptively, where the extent of contribution to the objective function of RELM is treated as the criterion for judging each hidden node, that is, the large the better, and vice versa. As a result, the better hidden nodes are kept. On the contrary, the so-called worse hidden nodes are deleted. Naturally, the hidden nodes of RELM are selected optimally. In contrast to the other method only with the add mechanism, the proposed one has some advantages in the number of hidden nodes, generalization performance, and the real time. The experimental results on classical chaotic time series demonstrate the effectiveness and feasibility of the proposed add-delete mechanism for RELM.

Reference (15)

Catalog

    /

    返回文章
    返回