首页> 外文会议>Neural Networks (IJCNN), The 2012 International Joint Conference on >A modified fast recursive hidden nodes selection algorithm for ELM
【24h】

A modified fast recursive hidden nodes selection algorithm for ELM

机译:改进的ELM快速递归隐藏节点选择算法

获取原文

摘要

Extreme Learning Machine (ELM) is a new paradigm for using Single-hidden Layer Feedforward Networks (SLFNs) with a much simpler training method. The input weights and the bias of the hidden layer are randomly chosen and output weights are analytically determined. One of the open problems in ELM research is how to automatically determine network architectures for given tasks. In this paper, it is taken as a model selection problem, a modified fast recursive algorithm (MFRA) is introduced to quickly and efficiently estimate the contribution of each hidden layer node to the decrease of the net function, and then a leave one out (LOO) cross validation is used to select the optimal number of hidden layer nodes. Simulation results on both artificial and real world benchmark datasets indicate the effectiveness of the proposed method.
机译:极限学习机(ELM)是一种使用单隐藏层前馈网络(SLFN)的新范例,其训练方法要简单得多。随机选择隐藏层的输入权重和偏差,并通过分析确定输出权重。 ELM研究中的开放问题之一是如何自动确定给定任务的网络体系结构。本文将其作为模型选择问题,引入改进的快速递归算法(MFRA)快速有效地估计每个隐层节点对网络功能下降的贡献,然后省略( LOO)交叉验证用于选择隐藏层节点的最佳数量。在人工基准数据集和实际基准数据集上的仿真结果均表明了该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号