By Topic

Convergence analysis of rival penalized competitive learning (RPCL) algorithm

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)
Jinwen Ma ; Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin, China ; Taijun Wang ; Lei Xu

This paper analyzes the convergence of the rival penalized competitive learning (RPCL) algorithm via a cost function. It is shown that as RPCL process decreases the cost to a global minimum, a correct number of weight vectors will converge to each center of the clusters in the sample data respectively, while the others diverge

Published in:

Neural Networks, 2002. IJCNN '02. Proceedings of the 2002 International Joint Conference on  (Volume:2 )

Date of Conference:

2002