.png){kind=icon}
Return
On the kernel Extreme Learning Machine classifier
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2014.12.003.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we discuss the connection of the kernel versions of the ELM classifier with infinite Single-hidden Layer Feedforward Neural networks and show that the original ELM kernel definition can be adopted for the calculation of the ELM kernel matrix for two of the most common activation functions, i.e., the RBF and the sigmoid functions. In addition, we show that a low-rank decomposition of the kernel matrix defined on the input training data can be exploited in order to determine an appropriate ELM space for input data mapping. The ELM space determined from this process can be subsequently used for network training using the original ELM formulation. Experimental results denote that the adoption of the low-rank decomposition-based ELM space determination leads to enhanced performance, when compared to the standard choice, i.e., random input weights generation. (C) 2014 Elsevier B.V. All rights reserved.
Keywords:
Extreme learning machine
Single-hidden layer networks
Infinite networks
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
Cited Papers
ShareSaveProductivity enhancement of solar still by PCM and Nanoparticles miscellaneous basin absorbing materials.png)
Desalination
OAAI
DesalinationIF0
OAAIShareSave
ShareSaveShareSaveShareSaveShareSaveThe Influence of Replacing Aggregates and Cement by LFS on the Corrosion of Steel ReinforcementsOAAI
OAAIShareSaveShareSaveShareSave
View more