搜索

x
中国物理学会期刊

基于Cholesky分解的增量式RELM及其在时间序列预测中的应用

CSTR: 32037.14.aps.60.110201

Incremental regularized extreme learning machine based on Cholesky factorization and its application to time series prediction

CSTR: 32037.14.aps.60.110201
PDF
导出引用
  • 针对应用于混沌时间序列预测的正则极端学习机(RELM)网络结构设计问题,提出一种基于Cholesky分解的增量式RELM训练算法.该算法通过逐次增加隐层神经元的方式自动确定最佳的RELM网络结构,并以Cholesky分解方式计算其输出权值,有效减小了隐层神经元递增过程的计算代价.混沌时间序列预测实例表明,该算法可有效实现最佳RELM网络结构的自动确定,且计算效率高.利用该算法训练后的RELM预测模型具有预测精度高的优点,适用于混沌时间序列预测.

     

    In order to solve the hidden-layer neuron determination problem of regularized extreme learning machine (RELM) applied to chaotic time series prediction, a new algorithm based on Cholesky factorization is proposed. First, an RELM-based prediction model with one hidden-layer neuron is constructed and then a new hidden-layer neuron is added to the prediction model in each training step until the generalization performance of the prediction model reaches its peak value. Thus, the optimal network structure of the prediction model is determined. In the training procedure, Cholesky factorization is used to calculate the output weights of RELM. Experiments on chaotic time series prediction indicate that the algorithm can be effectively used to determine the optimal network strueture of RELM, and the prediction model trained by the algorithm has excellent performance in prediction accuracy and computational cost.

     

    目录

    /

    返回文章
    返回
    Baidu
    map