Memetic Extreme Learning Machine

Publication Type:
Journal Article
Citation:
Pattern Recognition, 2016, 58 pp. 135 - 148
Issue Date:
2016
Full metadata record
Files in This Item:
Filename Description Size
1-s2.0-S0043135415303717-main.pdfPublished Version1.76 MB
Adobe PDF
© 2016. Extreme Learning Machine (ELM) is a promising model for training single-hidden layer feedforward networks (SLFNs) and has been widely used for classification. However, ELM faces the challenge of arbitrarily selected parameters, e.g., the network weights and hidden biases. Therefore, many efforts have been made to enhance the performance of ELM, such as using evolutionary algorithms to explore promising areas of the solution space. Although evolutionary algorithms can explore promising areas of the solution space, they are not able to locate global optimum efficiently. In this paper, we present a new Memetic Algorithm (MA)-based Extreme Learning Machine (M-ELM for short). M-ELM embeds the local search strategy into the global optimization framework to obtain optimal network parameters. Experiments and comparisons on 46 UCI data sets validate the performance of M-ELM. The corresponding results demonstrate that M-ELM significantly outperforms state-of-the-art ELM algorithms.
Please use this identifier to cite or link to this item:

Not enough data to produce graph