Enforcement of the principal component analysis–extreme learning machine algorithm by linear discriminant analysis

Hits: 8114
Research areas:
Year:
2016
Type of Publication:
Article
Authors:
Journal:
Neural Computing and Applications
Volume:
27
Number:
6
Pages:
1749–1760
Note:
JCR(2016): 2.505 Position: 40/133 (Q2) Category: COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE.
Abstract:
In the majority of traditional extreme learning machine (ELM) approaches, the parameters of the basis functions are randomly generated and do not need to be tuned, while the weights connecting the hidden layer to the output layer are analytically estimated. The determination of the optimal number of basis functions to be included in the hidden layer is still an open problem. Cross-validation and heuristic approaches (constructive and destructive) are some of the methodologies used to perform this task. Recently, a deterministic algorithm based on the principal component analysis (PCA) and ELM has been proposed to assess the number of basis functions according to the number of principal components necessary to explain the 90 % of the variance in the data. In this work, the PCA part of the PCA–ELM algorithm is joined to the linear discriminant analysis (LDA) as a hybrid means to perform the pruning of the hidden nodes. This is justified by the fact that the LDA approach is outperforming the PCA one on a set of problems. Hence, the idea of combining the two approaches in a LDA–PCA–ELM algorithm is shown to be in average better than its PCA–ELM and LDA–ELM counterparts. Moreover, the performance in classification and the number of basis functions selected by the algorithm, on a set of benchmark problems, have been compared and validated in the experimental section using nonparametric tests against a set of existing ELM techniques.
Comments:
JCR(2016): 2.505 Position: 40/133 (Q2) Category: COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE.
Online version
Back