arrow
返回

Incremental extreme learning machine with fully complex hidden nodes

delete2008-01-01
delete227
PRE
AI
G
Guang-Bin Huang *
M
Ming-Bin Li
陈
陈磊 (Lei Chen)
C
Chee‐Kheong Siew
DOI:10.1016/j.neucom.2007.07.025delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden nodes, IEEE Trans. Neural Networks 17(4) (2006) 879-892] has recently proposed an incremental extreme learning machine (I-ELM), which randomly adds hidden nodes incrementally and analytically determines the output weights. Although hidden nodes are generated randomly, the network constructed by I-ELM remains as a universal approximator. This paper extends I-ELM from the real domain to the complex domain. We show that. as long as the hidden layer activation function is complex continuous discriminatory or complex bounded nonlinear piecewise continuous. I-ELM can still approximate any target functions in the complex domain. The universal capability of the I-ELM in the complex domain is further verified by two function approximations and one channel equalization problems. (c) 2007 Elsevier B.V. All rights reserved.
Keyword:
feedforward networks
complex activation function
constructive networks
ELM
I-ELM
channel equalization
AI总结

AI总结

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

期刊

Neurocomputing 封面图
Neurocomputing
IF:
6.5
论文数:
2.5W
被引数:
6.5W

机构

N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
N
National University of Singapore
学者数:
7.6W
论文数: 6.5W
被引数: 11.4W
引用论文

引用论文

err分享
err收藏
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收藏
学者 查看更多内容