.png){kind=icon}
返回
LCA based RBF training algorithm for the concurrent fault situation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2016.01.047.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the construction of a radial basis function (RBF) network, one of the most important issues is the selection of RBF centers. However, many selection methods are designed for the fault free situation only. This paper first assumes that all the training samples are used for constructing a fault tolerant RBF network. We then add an l(1) norm regularizer into the fault tolerant objective function. According to the nature of the l(1) norm regularizer, some unnecessary RBF nodes are removed automatically during training. Based on the local competition algorithm (LCA) concept, we propose an analog method, namely fault tolerant LCA (FTLCA), to minimize the fault tolerant objective function. We prove that the proposed fault tolerant objective function has a unique optimal solution, and that the FTLCA converges to the global optimal solution. Simulation results show that the FTLCA is better than the orthogonal least square approach and the support vector regression approach. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
RBF
Center selection
LCA
Fault tolerance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
分享收藏Noise Exposure, Awareness, Practice and Noise Annoyance Among Steel Workers in United Arab Emirates
OAAI
OAAI分享收藏
Improving the tolerance of multilayer perceptrons by minimizing the statistical sensitivity to weight deviations.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容