A cost-function approach to rival penalized competitive learning (RPCL).
Rival penalized competitive learning (RPCL) has been shown to be a useful tool for clustering on a set of sample data in which the number of clusters is unknown. However, the RPCL algorithm was proposed heuristically and is still in lack of a mathematical theory to describe its convergence behavior. In order to solve the convergence problem, we investigate it via a cost-function approach. By theoretical analysis, we prove that a general form of RPCL, called distance-sensitive RPCL (DSRPCL), is associated with the minimization of a cost function on the weight vectors of a competitive learning network. As a DSRPCL process decreases the cost to a local minimum, a number of weight vectors eventually fall into a hypersphere surrounding the sample data, while the other weight vectors diverge to infinity. Moreover, it is shown by the theoretical analysis and simulation experiments that if the cost reduces into the global minimum, a correct number of weight vectors is automatically selected and located around the centers of the actual clusters, respectively. Finally, we apply the DSRPCL algorithms to unsupervised color image segmentation and classification of the wine data.
Ma
Jinwen
J
Department of Information Science, School of Mathematical Sciences, Peking University, Beijing, China. jwma@math.pku.edu.cn
Wang
Taijun
T
D000465:Algorithms; D001185:Artificial Intelligence; D003163:Competitive Behavior; D003198:Computer Simulation; D005716:Game Theory; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*