LCA based RBF training algorithm for the concurrent fault situation

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 tol...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) 2016-05, Vol.191, p.341-351
Main Authors: Feng, Rui-Bin, Leung, Chi-Sing, Constantinides, A.G.
Format: Article
Language:English
Subjects:
Algorithms
Center selection
Fault tolerance
Fault tolerant
Faults
LCA
Networks
Norms
Optimization
RBF
Training
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 l1 norm regularizer into the fault tolerant objective function. According to the nature of the l1 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.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2016.01.047