Regularized extreme learning machine for regression with missing data

  • Authors:
  • Qi Yu;Yoan Miche;Emil Eirola;Mark Van Heeswijk;Eric SéVerin;Amaury Lendasse

  • Affiliations:
  • Department of Information and Computer Science, Aalto University, Espoo, 02150, Finland;Department of Information and Computer Science, Aalto University, Espoo, 02150, Finland;Department of Information and Computer Science, Aalto University, Espoo, 02150, Finland;Department of Information and Computer Science, Aalto University, Espoo, 02150, Finland;LEM, Université Lille 1, 59043 Lille cedex, France;Department of Information and Computer Science, Aalto University, Espoo, 02150, Finland and IKERBASQUE, Basque Foundation for Science, 48011 Bilbao, Spain and Computational Intelligence Group, Com ...

  • Venue:
  • Neurocomputing
  • Year:
  • 2013

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper proposes a method which is the advanced modification of the original extreme learning machine with a new tool for solving the missing data problem. It uses a cascade of L"1 penalty (LARS) and L"2 penalty (Tikhonov regularization) on ELM (TROP-ELM) to regularize the matrix computations and hence makes the MSE computation more reliable, and on the other hand, it estimates the expected pairwise distances between samples directly on incomplete data so that it offers the ELM a solution to solve the missing data issues. According to the experiments on five data sets, the method shows its significant advantages: fast computational speed, no parameter need to be tuned and it appears more stable and reliable generalization performance by the two penalties. Moreover, it completes ELM with a new tool to solve missing data problem even when half of the training data are missing as the extreme case.