Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse
In online sequential applications, a machine learning model needs to have a self-updating ability to handle the situation, which the training set is changing. Conventional incremental extreme learning machine (ELM) and online sequential ELM are usually achieved in two approaches: directly updating t...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2017-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8057769/ |
id |
doaj-e0c974298e2143b9bacf16669af7abbb |
---|---|
record_format |
Article |
spelling |
doaj-e0c974298e2143b9bacf16669af7abbb2021-03-29T20:12:27ZengIEEEIEEE Access2169-35362017-01-015208522086510.1109/ACCESS.2017.27586458057769Incremental and Decremental Extreme Learning Machine Based on Generalized InverseBo Jin0https://orcid.org/0000-0003-1028-5989Zhongliang Jing1Haitao Zhao2School of Computer Science and Software Engineering, East China Normal University, Shanghai, ChinaSchool of Aeronautics and Astronautics, Shanghai Jiaotong University, Shanghai, ChinaSchool of Information Science and Engineering, East China University of Science and Technology, Shanghai, ChinaIn online sequential applications, a machine learning model needs to have a self-updating ability to handle the situation, which the training set is changing. Conventional incremental extreme learning machine (ELM) and online sequential ELM are usually achieved in two approaches: directly updating the output weight and recursively computing the left pseudo inverse of the hidden layer output matrix. In this paper, we develop a novel solution for incremental and decremental ELM (DELM), via recursively updating and downdating the generalized inverse of the hidden layer output matrix. By preserving the global optimality and best generalization performance, our approach implements node incremental ELM (N-IELM) and sample incremental ELM (S-IELM) in a universal form, and overcomes the problem of selfstarting and numerical instability in the conventional online sequential ELM. We also propose sample DELM (S-DELM), which is the first decremental version of ELM. The experiments on regression and classification problems with real-world data sets demonstrate the feasibility and effectiveness of the proposed algorithms with encouraging performances.https://ieeexplore.ieee.org/document/8057769/Extreme learning machineonline sequential ELMincremental ELMdecremental ELMgeneralized inverse |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Bo Jin Zhongliang Jing Haitao Zhao |
spellingShingle |
Bo Jin Zhongliang Jing Haitao Zhao Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse IEEE Access Extreme learning machine online sequential ELM incremental ELM decremental ELM generalized inverse |
author_facet |
Bo Jin Zhongliang Jing Haitao Zhao |
author_sort |
Bo Jin |
title |
Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse |
title_short |
Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse |
title_full |
Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse |
title_fullStr |
Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse |
title_full_unstemmed |
Incremental and Decremental Extreme Learning Machine Based on Generalized Inverse |
title_sort |
incremental and decremental extreme learning machine based on generalized inverse |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2017-01-01 |
description |
In online sequential applications, a machine learning model needs to have a self-updating ability to handle the situation, which the training set is changing. Conventional incremental extreme learning machine (ELM) and online sequential ELM are usually achieved in two approaches: directly updating the output weight and recursively computing the left pseudo inverse of the hidden layer output matrix. In this paper, we develop a novel solution for incremental and decremental ELM (DELM), via recursively updating and downdating the generalized inverse of the hidden layer output matrix. By preserving the global optimality and best generalization performance, our approach implements node incremental ELM (N-IELM) and sample incremental ELM (S-IELM) in a universal form, and overcomes the problem of selfstarting and numerical instability in the conventional online sequential ELM. We also propose sample DELM (S-DELM), which is the first decremental version of ELM. The experiments on regression and classification problems with real-world data sets demonstrate the feasibility and effectiveness of the proposed algorithms with encouraging performances. |
topic |
Extreme learning machine online sequential ELM incremental ELM decremental ELM generalized inverse |
url |
https://ieeexplore.ieee.org/document/8057769/ |
work_keys_str_mv |
AT bojin incrementalanddecrementalextremelearningmachinebasedongeneralizedinverse AT zhongliangjing incrementalanddecrementalextremelearningmachinebasedongeneralizedinverse AT haitaozhao incrementalanddecrementalextremelearningmachinebasedongeneralizedinverse |
_version_ |
1724195148200411136 |