期刊
NEUROCOMPUTING
卷 191, 期 -, 页码 341-351出版社
ELSEVIER
DOI: 10.1016/j.neucom.2016.01.047
关键词
RBF; Center selection; LCA; Fault tolerance
资金
- Research Grants Council of the Government of the Hong Kong Special Administrative Region [CityU 115612]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据