Open Access Open Access  Restricted Access Subscription or Fee Access

Enhancing Extreme Learning Machines Using Cross-Entropy Moth-Flame Optimization Algorithm

Oyekale Abel Alade, Roselina Sallehuddin, Nor Haizan Mohamed Radzi

Abstract



Extreme Learning Machines (ELM) learn fast and eliminate the tuning of input weights and biases. However, ELM does not guarantee the optimal setting of the weights and biases due to random input parameters initialization. Therefore, ELM suffers from instability of output, large network size, and degrade generalization performance. To overcome these problems, an efficient co-evolutionary hybrid model namely as Cross-Entropy Moth-Flame Optimization (CEMFO-ELM) model is proposed to train a neural network for the selection of optimal input weights and biases. The hybrid model balanced the exploration and exploitation of the search space, and then selected optimal input weights and biases for ELM. The co-evolutionary algorithm reduced the chances of been trapped into the local extremum in the search space. Accuracy, stability, and percentage improvement ratio (PIR%) were the metrics used to evaluate the performance of the proposed model when simulated on some classification datasets for machine learning from the University of California, Irvine repository. The co-evolutionary scheme was compared with its constituent individual ELM-based enhanced meta-heuristic schemes (CE-ELM and MFO-ELM). The co-evolutionary meta-heuristic algorithm enhances the selection of optimal parameters for ELM. It improves the accuracy of ELM in all the simulations, and the stability of ELM was improved in all, up to 53% in Breast cancer simulation. Also, it has better convergences than the comparative ELM hybrid model in all the simulations.

Keywords


Cross-entropy, convergence, Extreme Learning Machines, meta-heuristic algorithms, Moth-flame Optimization, swarm intelligence optimization.

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.