By Topic

Optimization of EBFN architecture by an improved RPCL algorithm with application to process control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Li Xin ; Shanghai Univ., China ; Zheng Yu ; Jiang Fangze

EBF networks are an extension of radial basis function (RBF) networks. Selecting an appropriate number of clusters is a problem for RBF or EBF networks. The rival penalized competitive learning (RPCL) algorithm is designed to solve this problem but its performance is not satisfactory when the data has overlapped clusters and the input vectors contain dependent components. The paper addresses this problem by incorporating full covariance matrices into the original RPCL algorithm. The resulting algorithm, referred to as the improved RPCL algorithm progressively eliminates the units whose clusters contain only a small portion of the training data. The improved algorithm is applied to optimize the architecture of elliptical basis function networks for process control. The results show that the covariance matrices in the improved RPCL algorithm have a better representation of the clusters

Published in:

Intelligent Control and Automation, 2000. Proceedings of the 3rd World Congress on  (Volume:2 )

Date of Conference:

2000