Cooperation Controlled Competitive Learning Approach for Data Clustering

Rival penalized competitive learning (RPCL) and its variants can perform clustering analysis efficiently with the ability of selecting the cluster number automatically. Although they have been widely applied in a variety of research areas, some of their problems have not yet been solved. Based on the semi-competitive learning mechanism of competitive and cooperative learning (CCL), this paper presents a new robust learning algorithm named Cooperation controlled competitive learning (CCCL), in which the learning rate of each seed points within the same cooperative team can be adjusted adaptively. CCCL has not only inherited the merits of CCL, RPCL and its variants, but also overcome most of their shortcomings. It is insensitive to the initialization of the seed points and applicable to the heterogeneous clusters with an attractive accurate convergence property. Experiments have shown the efficacy of CCCL. Moreover, in some case its performance is prior to CCL and some other variants of RPCL.

[1]  Yiu-ming Cheung,et al.  Maximum weighted likelihood via rival penalized EM for density mixture clustering with automatic model selection , 2005, IEEE Transactions on Knowledge and Data Engineering.

[2]  Stephen Grossberg,et al.  Competitive Learning: From Interactive Activation to Adaptive Resonance , 1987, Cogn. Sci..

[3]  Lei Xu,et al.  A RPLC-based approach for identification of Markov model with unknown noise and number of states , 2000, Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks. IJCNN 2000. Neural Computing: New Challenges and Perspectives for the New Millennium.

[4]  Lei Xu,et al.  Adaptive Rival Penalized Competitive Learning and Combined Linear Predictor Model for Financial Forecast and Investment , 1997, Int. J. Neural Syst..

[5]  Lei Xu,et al.  Rival Penalized Competitive Learning Based Separator on Binary Sources Separation , 1998, ICONIP.

[6]  Yiu-ming Cheung,et al.  On Rival Penalization Controlled Competitive Learning for Clustering with Automatic Cluster Number Selection , 2005, IEEE Trans. Knowl. Data Eng..

[7]  Lei Xu,et al.  Rival Penalized Competitive Learning Based Approach for Discrete-Valued Source Separation , 2000, Int. J. Neural Syst..

[8]  Erkki Oja,et al.  Rival penalized competitive learning for clustering analysis, RBF net, and curve detection , 1993, IEEE Trans. Neural Networks.

[9]  Lei Xu,et al.  An RPCL-based approach for Markov model identification with unknown state number , 2000, IEEE Signal Process. Lett..

[10]  Yu-ming Cheung.  Rival penalization controlled competitive learning for data clustering with unknown cluster number , 2002, Proceedings of the 9th International Conference on Neural Information Processing, 2002. ICONIP '02..

[11]  Yiu-ming Cheung,et al.  On Weight Design of Maximum Weighted Likelihood and an Extended EM Algorithm , 2006, IEEE Transactions on Knowledge and Data Engineering.

[12]  Jinwen Ma,et al.  A cost-function approach to rival penalized competitive learning (RPCL) , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[13]  Stephen Grossberg,et al.  From Interactive Activation to Adaptive Resonance , 1987 .

[14]  David Zipser,et al.  Feature Discovery by Competive Learning , 1986, Cogn. Sci..

[15]  J. MacQueen.  Some methods for classification and analysis of multivariate observations , 1967 .

[16]  E. Forgy,et al.  Cluster analysis of multivariate data : efficiency versus interpretability of classifications , 1965 .

[17]  Stanley C. Ahalt,et al.  Competitive learning algorithms for vector quantization , 1990, Neural Networks.

[18]  Michael K. Ng,et al.  An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data , 2007, IEEE Transactions on Knowledge and Data Engineering.

[19]  Yiu-ming Cheung.  A competitive and cooperative learning approach to robust data clustering , 2004, Neural Networks and Computational Intelligence.