返回
Incremental extreme learning machine with fully complex hidden nodes
DOI:10.1016/j.neucom.2007.07.025.png)
摘要
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总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
DNA damage repair: historical perspectives, mechanistic pathways and clinical translation for targeted cancer therapyDNA损伤修复: 靶向癌症治疗的历史视角、机制途径和临床转化
Enhanced Renal Protection in Acute Kidney Injury with ROS-Activated Nanoparticles Targeting Oxidative Stress and Inflammation通过靶向氧化应激和炎症的ROS激活纳米颗粒增强急性肾损伤的肾脏保护作用
Design optimisation of submersible permanent magnet synchronous motor by combined DOE and Taguchi approachDOE与Taguchi相结合的潜水永磁同步电机优化设计

