4.7 Article

Memetic Extreme Learning Machine

Journal

PATTERN RECOGNITION
Volume 58, Issue -, Pages 135-148

Publisher

ELSEVIER SCI LTD
DOI: 10.1016/j.patcog.2016.04.003

Keywords

Extreme Learning Machine; Self-adaptive; Memetic Algorithm; Evolutionary Machine Learning; Classification

Funding

  1. National Nature Science Foundation of China [61403351]
  2. China Scholarship Council Foundation [201206410056]
  3. Natural Science Foundation of Hubei province, China [2013CFA004]
  4. Self-Determined and Innovative Research Founds of CUG [1610491T05]
  5. National College Students' Innovation Entrepreneurial Training Plan of CUG (WuHan) [201410491083]

Ask authors/readers for more resources

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. (C) 2016 Elsevier Ltd. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available