arrow
返回

Sparse Extreme Learning Machine for Classification

delete2014-10-01
delete185
delete
OA
AI
Z
Zuo Bai *
G
Guang-Bin Huang
D
Danwei Wang
王涵 封面图
王涵 (Han Wang)
M
M. Brandon Westover
DOI:10.1109/TCYB.2014.2298235delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Extreme learning machine (ELM) was initially proposed for single-hidden-layer feedforward neural networks (SLFNs). In the hidden layer (feature mapping), nodes are randomly generated independently of training data. Furthermore, a unified ELM was proposed, providing a single framework to simplify and unify different learning methods, such as SLFNs, least square support vector machines, proximal support vector machines, and so on. However, the solution of unified ELM is dense, and thus, usually plenty of storage space and testing time are required for large-scale applications. In this paper, a sparse ELM is proposed as an alternative solution for classification, reducing storage space and testing time. In addition, unified ELM obtains the solution by matrix inversion, whose computational complexity is between quadratic and cubic with respect to the training size. It still requires plenty of training time for large-scale problems, even though it is much faster than many other traditional methods. In this paper, an efficient training algorithm is specifically developed for sparse ELM. The quadratic programming problem involved in sparse ELM is divided into a series of smallest possible sub-problems, each of which are solved analytically. Compared with SVM, sparse ELM obtains better generalization performance with much faster training speed. Compared with unified ELM, sparse ELM achieves similar generalization performance for binary classification applications, and when dealing with large-scale binary classification problems, sparse ELM realizes even faster training speed than unified ELM.
Keyword:
Classification
extreme learning machine (ELM)
quadratic programming (QP)
sequential minimal optimization (SMO)
sparse ELM
support vector machine (SVM)
unified ELM
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Transactions on Cybernetics 封面图
IEEE Transactions on Cybernetics
IF:
10.5
论文数:
1.1W
被引数:
5.0W

机构

H
Harvard University
学者数:
26.5W
论文数: 22.0W
被引数: 28.7W
N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
引用论文

引用论文

Fully complex extreme learning machine
err2005-10-01
err270
PREAI
errLi, MB; Huang, GB; Saratchandran, P; Sundararajan, N
err分享
err收藏
Can threshold networks be trained directly?
err2006-03-01
err214
PREAI
errHuang, GB; Zhu, QY; Mao, KZ; Siew, CK; Saratchandran, P; Sundararajan, N
err分享
err收藏
err1999-01-01
err0
PREAI
errJ.A.K. Suykens; J. Vandewalle
err分享
err收藏
Optimization method based extreme learning machine for classification
err2010-12-01
err813
PREAI
errHuang, Guang-Bin; Ding, Xiaojian; Zhou, Hongming
err分享
err收藏
The No-Prop algorithm: A new learning algorithm for multilayer neural networks
err2013-01-01
err133
PREAI
errWidrow, Bernard; Greenblatt, Aaron; Kim, Youngsik; Park, Dookun
err分享
err收藏
学者 查看更多内容