Skip navigation
Run Run Shaw Library City University of Hong KongRun Run Shaw Library

Please use this identifier to cite or link to this item: http://dspace.cityu.edu.hk/handle/2031/8738
Title: RBF networks with concurrent fault situation
Authors: Fung, Yan Yee
Department: Department of Electronic Engineering
Issue Date: 2016
Supervisor: Supervisor: Prof. Leung, Andrew C S; Assessor: Dr. Chan, Kwok Leung
Abstract: As a neural network model, RBF network has been extensively studied in these recent two eras. At the present stage, the most effective way to handle node and weight failure situation, which happens a lot in RBF network, is yet to be discussed. General speaking, there are four kinds of node and weight failure in RBF networks. They are open node fault, open weight fault, node noise and weight noise. Studies have been done generally to deal with situation where only one kind of failure is in a network. Last year, my fellow did a project to handle four concurrent node fault situation using orthogonal least square (OLS) method. However, it requires an additional learning algorithm for selecting the RBF centers. In this project, we add a 𝑙1 norm regularizer into the fault tolerant objective function. During training, it can automatically eliminate unimportant RBF nodes. In this approach, we need to the weighting factor to control the number of the selected. To minimize the objective functions, I use the alternating direction method of multipliers (ADMM) framework. ADMM is an algorithm that solves convex optimization problems. In my approach, no extra algorithm is required to select the RBF centres. Simulation results show that my approach is superior than the OLS based approach.
Appears in Collections:Electrical Engineering - Undergraduate Final Year Projects 

Files in This Item:
File SizeFormat 
fulltext.html146 BHTMLView/Open
Show full item record


Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.

Send feedback to Library Systems
Privacy Policy | Copyright | Disclaimer