- Research Article
214
- 10.1016/j.neucom.2011.06.013
Regularized extreme learning machine for regression problems
- Jul 23, 2011
- Neurocomputing
- José M Martínez-Martínez + 5 more +5
Regularized extreme learning machine for regression problems
A novel extreme learning Machine-based Hammerstein-Wiener model for complex nonlinear industrial processes
Regularized extreme learning machine for regression problems
Regularized extreme learning machine for regression problems
DCS-ELM: a novel method for extreme learning machine for regression problems and a new approach for the SFRSCC
Extreme learning machine (ELM) algorithm is widely used in regression and classification problems due to its advantages such as speed and high-performance rate. Different artificial intelligence-based optimization methods and chaotic systems have been proposed for the development of the ELM. However, a generalized solution method and success rate at the desired level could not be obtained. In this study, a new method is proposed as a result of developing the ELM algorithm used in regression problems with discrete-time chaotic systems. ELM algorithm has been improved by testing five different chaotic maps (Chebyshev, iterative, logistic, piecewise, tent) from chaotic systems. The proposed discrete-time chaotic systems based ELM (DCS-ELM) algorithm has been tested in steel fiber reinforced self-compacting concrete data sets and public four different datasets, and a result of its performance compared with the basic ELM algorithm, linear regression, support vector regression, kernel ELM algorithm and weighted ELM algorithm. It has been observed that it gives a better performance than other algorithms.
Read moreA new 3D segmentation approach using extreme learning machine algorithm and morphological operations
A new 3D segmentation approach using extreme learning machine algorithm and morphological operations
Smoothing L0 Regularization for Extreme Learning Machine
Extreme learning machine (ELM) has been put forward for single hidden layer feedforward networks. Because of its powerful modeling ability and it needs less human intervention, the ELM algorithm has been used widely in both regression and classification experiments. However, in order to achieve required accuracy, it needs many more hidden nodes than is typically needed by the conventional neural networks. This paper considers a new efficient learning algorithm for ELM with smoothing L0 regularization. A novel algorithm updates weights in the direction along which the overall square error is reduced the most and then this new algorithm can sparse network structure very efficiently. The numerical experiments show that the ELM algorithm with smoothing L0 regularization has less hidden nodes but better generalization performance than original ELM and ELM with L1 regularization algorithms.
Read moreSelf-adaptive Extreme Learning Machine Optimized by Rough Set Theory and Affinity Propagation Clustering
Recently, a simple and efficient learning algorithm for single hidden layer feedforward networks (SLFNs) called extreme learning machine (ELM) has been developed by G.-B. Huang et al. One key strength of ELM algorithm is that there is only one parameter, the number of hidden nodes, to be determined while it has the significantly low computational time required for training new classifiers and good generalization performance. However, there is no effective method for finding the proper and universal number of hidden nodes. In order to address this problem, we propose a self-adaptive extreme learning machine (SELM) algorithm. SELM algorithm determines self-adaptively the number of hidden nodes and constructs Gaussian function as activation functions of hidden nodes. And in this algorithm, rough set theory acts as the pre-treatment cell to eliminate the redundant attributes of data sets. Then, affinity propagation clustering (AP Clustering) is used to self-adaptively determine the number of hidden nodes, while the centers and widths of AP clustering are utilized to construct a Gaussian function in the hidden layer of SLFNs. Empirical study of SELM algorithm on several commonly used classification benchmark problems shows that the proposed algorithm can find the proper number of hidden nodes and construct compact network classifiers, comparing with traditional ELM algorithm.
Read moreExtreme Learning Machine Denoising Algorithm-Based Transvaginal Three-dimensional Ultrasound Imaging on the Diagnosis Efficiency of Intrauterine Adhesions
The study was intended to eliminate the noise in three-dimensional transvaginal ultrasound (3D-TVS) images and improve the diagnostic accuracy in intrauterine adhesion (IUA). The extreme learning machine (ELM) algorithm was introduced first for statement. One hundred and thirty cases of suspected IUA patients were taken as the research subjects. The denoising effects of ELM algorithm were evaluated in terms of mean square errors (MSE), peak signal-to-noise ratio (PSNR), and running time, and its diagnostic efficiency of IUA was identified from precise, specificity, and sensitivity. Furthermore, the support vector machine (SVM) algorithm was introduced for comparison. It was found that the MSE and PSNR of the ELM algorithm were 0.0021 and 64.5, respectively, and its average operation time was 11.22 ± 0.89s, that the MSE values of SVM algorithm and ELM algorithm were 0.0045 and 0.0021 and the PSNR values were 52.3 and 64.5, respectively, and that the average running time of SVM algorithm was 16.35 ± 1.33s, and the average running time of ELM algorithm was 11.22 ± 0.89s, superior to the SVM algorithm in denoising effects. Moreover, the ELM algorithm showed excellent diagnostic efficiency for patients with various degrees of IUA. In conclusion, ELM can effectively eliminate noise in 3D-TVS images and demonstrates excellent diagnostic efficiency on IUA, which is worthy of clinical application.
Read moreOrdinal extreme learning machine
Ordinal extreme learning machine
Noise Resistant Training for Extreme Learning Machine
The extreme learning machine (ELM) concept provides some effective training algorithms to construct single hidden layer feedforward networks (SHLFNs). However, the conventional ELM algorithms were designed for the noiseless situation only, in which the outputs of the hidden nodes are not contaminated by noise. This paper presents two noise-resistant training algorithms, namely noise-resistant incremental ELM (NRI-ELM) and noise-resistant convex incremental ELM (NRCI-ELM). For NRI-ELM, its noise-resistant ability is better than that of the conventional incremented ELM algorithms. To further enhance the noise resistant ability, the NRCI-ELM algorithm is proposed. The convergent properties of the two proposed noise resistant algorithms are also presented.
Read moreHONNs with Extreme Learning Machine to Handle Incomplete Datasets
An Extreme Learning Machine (ELM) randomly chooses hidden neurons and analytically determines the output weights (Huang, et al., 2005, 2006, 2008). With the ELM algorithm, only the connection weights between hidden layer and output layer are adjusted. The ELM algorithm tends to generalize better at a very fast learning speed: it can learn thousands of times faster than conventionally popular learning algorithms (Huang, et al., 2006). Artificial Neural Networks (ANNs) have been widely used as powerful information processing models and adopted in applications such as bankruptcy prediction, predicting costs, forecasting revenue, forecasting share prices and exchange rates, processing documents, and many more. Higher Order Neural Networks (HONNs) are ANNs in which the net input to a computational neuron is a weighted sum of products of its inputs. Real life data are not usually perfect. They contain wrong, incomplete, or vague data. Hence, it is usual to find missing data in many information sources used. Missing data is a common problem in statistical analysis (Little & Rubin, 1987). This chapter uses the Extreme Learning Machine (ELM) algorithm for HONN models and applies it in several significant business cases, which involve missing datasets. The experimental results demonstrate that HONN models with the ELM algorithm offer significant advantages over standard HONN models, such as faster training, as well as improved generalization abilities.
Read moreEnsemble Extreme Learning Machine Based on a New Self-adaptive AdaBoost.RT
Extreme learning machine (ELM) has been well recognized as a new learning scheme for single-hidden layer feedforward networks (SLFNs) with extremely fast learning speed and high generalization performance. However, the stability and accuracy of ELM can be further enhanced. In this paper, a new hybrid machine learning method called robust AdaBoost.RT based ensemble ELM (RAE-ELM) for regression problems is proposed, which combined ELM with the novel self-adaptive AdaBoost.RT algorithm to achieve better approximation accuracy than using only single ELM network. To enable dynamically self-adjusting the threshold value during AdaBoost.RT computing without any empirical suggestion, the statistical parameters of applying ELM networks on the input dataset are adopted as indicators. The experiment results that applying the proposed algorithm on wide types of benchmark databases verify that RAE-ELM not only outperforms the conventional ELM but also achieves a higher stability and accuracy level than original and modified AdaBoost.RT-based ELM for regression problems.
Read moreThe casualty prediction of earthquake disaster based on Extreme Learning Machine method
In the prediction of casualties of earthquake disaster, the traditional prediction method requires strict sample data, and it is necessary to manually set a large number of parameters, resulting in poor prediction accuracy and slow learning speed. This paper introduces the Extreme Learning Machine (ELM) into the earthquake casualty prediction, aiming to improve the prediction accuracy. Through the data training, the ELM network structure of earthquake victims’ casualty prediction is established, and the number of hidden layer nodes and the excitation function are determined, which ensures the reliability of the ELM network prediction results. Based on the data of 84 groups of earthquake victims from China in 1970–2017, the ELM algorithm, BP neural network, SVM and modified partial Gaussian curve were compared and verified. The results show that the average relative error of ELM algorithm for earthquake disaster prediction is 3.37%, the coefficient of determination R-square is 0.96, the average relative error of injury prediction is 1.04%, and the coefficient of determination R-square is 0.97, which indicates that the ELM algorithm has good robustness and generalization ability.
Read moreGenetic algorithm optimization for extreme learning machine based microalgal growth forecasting of Chlamydomonas sp
Currently, microalgae cultivation is one of the most promising alternative solutions to alleviate the value of CO2 concentration. Microalgae growth rate is convinced to be the indicator to measure the effectiveness in capturing CO2. In this paper, the microalgal growth behavior by means of various pH concentrations is observed. From the observation data, the growth behavior is modeled by regression graphs using single hidden layer feed-forward network (SLFN). To train and test the data, extreme learning machine (ELM) algorithm is applied. Recently, ELM is approved to be the fastest algorithm to learn an SLFN for regression. ELM is also well-known for its high learning accuracy as various activation functions can be applied in hidden layer. Yet the over-fitting in regression is still an issue in ELM. Thus to alleviate this problem cross-validation method is employed. To optimize the algorithm, ELM is also combined with Genetic Algorithm. The result shows that regression using ELM-GA is more accurate than ELM in various numbers of neurons.
Read moreFast Face Recognition Via Sparse Coding and Extreme Learning Machine
Most face recognition approaches developed so far regard the sparse coding as one of the essential means, while the sparse coding models have been hampered by the extremely expensive computational cost in the implementation. In this paper, a novel scheme for the fast face recognition is presented via extreme learning machine (ELM) and sparse coding. The common feature hypothesis is first introduced to extract the basis function from the local universal images, and then the single hidden layer feedforward network (SLFN) is established to simulate the sparse coding process for the face images by ELM algorithm. Some developments have been done to maintain the efficient inherent information embedding in the ELM learning. The resulting local sparse coding coefficient will then be grouped into the global representation and further fed into the ELM ensemble which is composed of a number of SLFNs for face recognition. The simulation results have shown the good performance in the proposed approach that could be comparable to the state-of-the-art techniques at a much higher speed.
Read moreExtreme learning machine based transfer learning for data classification
Extreme learning machine based transfer learning for data classification
Epileptic EEG Detection via a Novel Pattern Recognition Framework
In this paper, we investigate the potential of a recently-developed machine learning algorithm named Extreme Learning Machine (ELM), together with Sample Entropy (SampEn), to the task of identifying epileptic EEG signals. In order to decrease network complexity of ELM and reduce the subjectivity involved in selecting the number of hidden neurons in ELM network, we propose a structure-optimized strategy for enhancing the ELM algorithm. Experimental results show that the proposed algorithm not only achieves more compact network structure and higher accuracy, but also needs less learning time than conventional ELM and gradient-based algorithms such as Backpropagation Neural Network (BPNN).
Read more