Energy based competitive learning

Authors:
Chang-Dong Wang;Jiang-Huang Lai
Affiliations:
School of Information Science and Technology, Sun Yat-sen University Guangzhou, PR China;School of Information Science and Technology, Sun Yat-sen University Guangzhou, PR China
Venue:
Neurocomputing
Year:
2011

Citing 12
Cited 3

BYY harmony learning, structural RPCL, and topological self-organizing on mixture models

Neural Networks - New developments in self-organizing maps
Strip line detection and thinning by RPCL-based local PCA

Pattern Recognition Letters
On Rival Penalization Controlled Competitive Learning for Clustering with Automatic Cluster Number Selection

IEEE Transactions on Knowledge and Data Engineering
Pattern Recognition and Machine Learning (Information Science and Statistics)

Pattern Recognition and Machine Learning (Information Science and Statistics)
Rapid and brief communication: Multisets mixture learning-based ellipse detection

Pattern Recognition
A unified perspective and new results on RHT computing, mixture based learning, and multi-learner based problem solving

Pattern Recognition
Toward Objective Evaluation of Image Segmentation Algorithms

IEEE Transactions on Pattern Analysis and Machine Intelligence
Generalized competitive learning of Gaussian mixture models

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
Asymptotic convergence properties of the EM algorithm with respect to the overlap in the mixture

Neurocomputing
A cost-function approach to rival penalized competitive learning (RPCL)

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Self-splitting competitive learning: a new on-line clustering paradigm

IEEE Transactions on Neural Networks
Rival penalized competitive learning for clustering analysis, RBF net, and curve detection

IEEE Transactions on Neural Networks

Letters: A new handwritten character segmentation method based on nonlinear clustering

Neurocomputing
Magnitude Sensitive Competitive Learning

Neurocomputing
Quantum annealing for Dirichlet process mixture models with applications to network clustering

Neurocomputing

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the three important issues associated with competitive learning clustering, which are auto-initialization, adaptation to clusters of different size and sparsity, and eliminating the disturbance caused by outliers. Although many competitive learning methods have been developed to deal with some of these problems, few of them can solve all the three problems simultaneously. In this paper, we propose a new competitive learning clustering method termed energy based competitive learning (EBCL) to simultaneously tackle these problems. Auto-initialization is achieved by extracting samples of high energy to form a core point set, whereby connected components are obtained as initial clusters. To adapt to clusters of different size and sparsity, a novel competition mechanism, namely, size-sparsity balance of clusters (SSB), is developed to select a winning prototype. For eliminating the disturbance caused by outliers, another new competition mechanism, namely, adaptive learning rate based on samples' energy (ALR), is proposed to update the winner. Data clustering experiments on 2000 simulated datasets comprising clusters of different size and sparsity, as well as with outliers, have been performed to verify the effectiveness of the proposed method. Then we apply EBCL to automatic color image segmentation. Comparison results show that the proposed EBCL outperforms existing competitive learning algorithms.