返回
Two-stage extreme learning machine for regression
DOI:10.1016/j.neucom.2010.07.012.png)
摘要
En 中文
Extreme learning machine (ELM) proposed by Huang et al. was developed for generalized single hidden layer feedforward networks (SLFNs) with a wide variety of hidden nodes. It proved to be very fast and effective especially for solving function approximation problems with a predetermined network structure. However, the method for determining the network structure of preliminary ELM may be tedious and may not lead to a parsimonious solution. In this paper, a systematic two-stage algorithm (named TS-ELM) is introduced to handle the problem. In the first stage, a forward recursive algorithm is applied to select the hidden nodes from the candidates randomly generated in each step and add them to the network until the stopping criterion achieves its minimum. The significance of each hidden node is then reviewed in the second stage and the insignificance ones are removed from the network, which drastically reduces the network complexity. The effectiveness of TS-ELM is verified by the empirical studies in this paper. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Extreme learning machine
Fast recursive algorithm
Final prediction error
Leave-one-out cross-validation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
Removal of lead(II) ions from aqueous solutions by adsorption onto pine cone activated carbon
Desalination
IF0
Adsorption of basic dye from aqueous solutions by modified sepiolite: Equilibrium, kinetics and thermodynamics study
Desalination
IF0

