SVM–ELM: Pruning of Extreme Learning Machine with Support Vector Machines for Regression
Open Access
- 29 September 2015
- journal article
- research article
- Published by Walter de Gruyter GmbH in Journal of Intelligent Systems
- Vol. 25 (4) , 555-566
Abstract
Extreme Learning Machine provides very competitive performance to other related classical predictive models for solving problems such as regression, clustering, and classification. An ELM possesses the advantage of faster computational time in both training and testing. However, one of the main challenges of an ELM is the selection of the optimal number of hidden nodes. This paper presents a new approach to node selection of an ELM based on a 1-norm support vector machine (SVM). In this method, the targets of SVM y i ∈{+1, –1} are derived using the mean or median of ELM training errors as a threshold for separating the training data, which are projected to SVM dimensions. We present an integrated architecture that exploits the sparseness in solution of SVM to prune out the inactive hidden nodes in ELM. Several experiments are conducted on real-world benchmark datasets, and the results attained attest to the efficiency of the proposed method.Keywords
This publication has 28 references indexed in Scilit:
- Face recognition based on extreme learning machineNeurocomputing, 2011
- Constructive hidden nodes selection of extreme learning machine for regressionNeurocomputing, 2010
- On the sparseness of 1-norm support vector machinesNeural Networks, 2010
- The hidden neurons selection of the wavelet networks using support vector machines and ridge regressionNeurocomputing, 2008
- A fast pruned-extreme learning machine for classification problemNeurocomputing, 2008
- Enhanced random search based incremental extreme learning machineNeurocomputing, 2008
- Universal Approximation using Incremental Constructive Feedforward Networks with Random Hidden NodesIEEE Transactions on Neural Networks, 2006
- Fast Monte Carlo reliability evaluation using support vector machineReliability Engineering & System Safety, 2002
- The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the networkIEEE Transactions on Information Theory, 1998
- Objective functions for training new hidden units in constructive neural networksIEEE Transactions on Neural Networks, 1997