arrow
返回

C-Loss-Based Doubly Regularized Extreme Learning Machine

delete2022-08-27
delete1
PRE
AI
Q
Qing Wu
Y
Yanlin Fu *
D
Dongshun Cui
W
Wang, En
DOI:10.1007/s12559-022-10050-2delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Extreme learning machine has become a significant learning methodology due to its efficiency. However, extreme learning machine may lead to overfitting since it is highly sensitive to outliers. In this paper, a novel extreme learning machine called the C-loss-based doubly regularized extreme learning machine is presented to handle dimensionality reduction and overfitting problems. The proposed algorithm benefits from both L-1 norm and L-2 norm and replaces the square loss function with a C-loss function. And the C-loss-based doubly regularized extreme learning machine can complete the feature selection and the training processes simultaneously. Additionally, it can also decrease noise or irrelevant information of data to reduce dimensionality. To show the efficiency in dimension reduction, we test it on the Swiss Roll dataset and obtain high efficiency and stable performance. The experimental results on different types of artificial datasets and benchmark datasets show that the proposed method achieves much better regression results and faster training speed than other compared methods. Performance analysis also shows it significantly decreases the training time, solves the problem of overfitting, and improves generalization ability.
Keyword:
Extreme learning machine
C-loss function
Feature selection
Regularization

期刊

Cognitive Computation 封面图
Cognitive Computation
IF:
4.3
论文数:
1.6K
被引数:
3.6K

机构

N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
引用论文

引用论文

err分享
err收藏
err分享
err收藏
err分享
err收藏
Sparse Extreme Learning Machine for Classification
err2014-10-01
err185
errOAAI
errBai, Zuo; Huang, Guang-Bin; Wang, Danwei; Wang, Han; Westover, M. Brandon
err分享
err收藏
学者 查看更多内容