.png){kind=icon}
Return
An improved algorithm for incremental extreme learning machine
.png){kind=icon}
OA
AI
DOI：10.1080/21642583.2020.1759156.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Incremental extreme learning machine (I-ELM) randomly obtains the input weights and the hidden layer neuron bias during the training process. Some hidden nodes in the ELM play a minor role in the network outputs which may eventually increase the network complexity and even reduce the stability of the network. In order to avoid this issue, this paper proposed an enhanced method for the I-ELM which is referred to as the improved incremental extreme learning machine (II-ELM). At each learning step of original I-ELM, an additional offset k will be added to the hidden layer output matrix before computing the output weights for the new hidden node and analysed the existence of the offset k. Compared with several improved algorithms of ELM, the advantages of the II-ELM in the training time, the forecasting accuracy, and the stability are verified on several benchmark datasets in the UCI database.
Keywords:
Extreme learning machine
incremental algorithm
random hidden nodes
single-hidden layer feedforward neural networks
Journal
IF:
4.4
Papers:
486
Citations:
2.1K
Organization
Cited Papers
ShareSaveShareSaveImproved bidirectional extreme learning machine based on enhanced random search.png)
MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
ShareSaveDigital and open innovationProceedings of the 15th International Conference on Knowledge Technologies and Data-driven Business
Proceedings of the 15th International Conference on Knowledge Technologies and Data-driven BusinessIF0
PREAI
ShareSaveShareSave
View more