Meta-cognitive extreme learning machine for regression problems

Author(s):  
Krishna Kumar N ◽  
R. Savitha ◽  
Abdullah Al Mamun
2015 ◽  
Vol 2015 ◽  
pp. 1-12 ◽  
Author(s):  
Pengbo Zhang ◽  
Zhixin Yang

Extreme learning machine (ELM) has been well recognized as an effective learning algorithm with extremely fast learning speed and high generalization performance. However, to deal with the regression applications involving big data, the stability and accuracy of ELM shall 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 robust AdaBoost.RT algorithm to achieve better approximation accuracy than using only single ELM network. The robust threshold for each weak learner will be adaptive according to the weak learner’s performance on the corresponding problem dataset. Therefore, RAE-ELM could output the final hypotheses in optimally weighted ensemble of weak learners. On the other hand, ELM is a quick learner with high regression performance, which makes it a good candidate of “weak” learners. We prove that the empirical error of the RAE-ELM is within a significantly superior bound. The experimental verification has shown that the proposed RAE-ELM outperforms other state-of-the-art algorithms on many real-world regression problems.


2011 ◽  
Vol 74 (17) ◽  
pp. 3716-3721 ◽  
Author(s):  
José M. Martínez-Martínez ◽  
Pablo Escandell-Montero ◽  
Emilio Soria-Olivas ◽  
José D. Martín-Guerrero ◽  
Rafael Magdalena-Benedito ◽  
...  

2020 ◽  
Vol 131 ◽  
pp. 14-28
Author(s):  
Bruno Légora Souza da Silva ◽  
Fernando Kentaro Inaba ◽  
Evandro Ottoni Teatini Salles ◽  
Patrick Marques Ciarelli

2021 ◽  
Vol 7 ◽  
pp. e411
Author(s):  
Osman Altay ◽  
Mustafa Ulas ◽  
Kursat Esat Alyamac

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.


2010 ◽  
Vol 1 (1) ◽  
pp. 43-58 ◽  
Author(s):  
Federico Montesino Pouzols ◽  
Amaury Lendasse

2018 ◽  
Vol 275 ◽  
pp. 2810-2823 ◽  
Author(s):  
Yong-Ping Zhao ◽  
Ying-Ting Pan ◽  
Fang-Quan Song ◽  
Liguo Sun ◽  
Ting-Hao Chen

Sign in / Sign up

Export Citation Format

Share Document