4.6 Article

Regularized extreme learning machine for regression with missing data

Journal

NEUROCOMPUTING
Volume 102, Issue -, Pages 45-51

Publisher

ELSEVIER
DOI: 10.1016/j.neucom.2012.02.040

Keywords

ELM; Ridge regression; Tikhonov regularization; LARS; Missing data; Pairwise distance estimation

Ask authors/readers for more resources

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. (C) 2012 Elsevier B.V. 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.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available