2005 Special Issue: Unifying cost and information in information-theoretic competitive learning
Neural Networks - 2005 Special issue: IJCNN 2005
A fast fixed-point BYY harmony learning algorithm on Gaussian mixture with automated model selection
Pattern Recognition Letters
An efficient k'-means clustering algorithm
Pattern Recognition Letters
Expansive competitive learning for kernel vector quantization
Pattern Recognition Letters
Image categorization via robust pLSA
Pattern Recognition Letters
Clustering: A neural network approach
Neural Networks
Knowledge discovery by a neuro-fuzzy modeling framework
Fuzzy Sets and Systems
Automatic configuration of spectral dimensionality reduction methods
Pattern Recognition Letters
Engineering Applications of Artificial Intelligence
A clustering-based differential evolution for global optimization
Applied Soft Computing
Efficient pipelined architecture for competitive learning
Journal of Parallel and Distributed Computing
Energy based competitive learning
Neurocomputing
Multicategory classification based on the hypercube self-organizing mapping (SOM) scheme
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
Computational Biology and Chemistry
A comparative study of RPCL and MCE based discriminative training methods for LVCSR
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
Image segmentation with BYY-RPCL framework
IScIDE'11 Proceedings of the Second Sino-foreign-interchange conference on Intelligent Science and Intelligent Data Engineering
A New Density-Based Scheme for Clustering Based on Genetic Algorithm
Fundamenta Informaticae
k'-Means algorithms for clustering analysis with frequency sensitive discrepancy metrics
Pattern Recognition Letters
Warped K-Means: An algorithm to cluster sequentially-distributed data
Information Sciences: an International Journal
Two-phase image segmentation with the competitive learning based chan-vese (CLCV) model
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
Kernel k'-means algorithm for clustering analysis
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Evolving soft subspace clustering
Applied Soft Computing
Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Hi-index | 0.00 |
It is shown that frequency sensitive competitive learning (FSCL), one version of the recently improved competitive learning (CL) algorithms, significantly deteriorates in performance when the number of units is inappropriately selected. An algorithm called rival penalized competitive learning (RPCL) is proposed. In this algorithm, not only is the winner unit modified to adapt to the input for each input, but its rival (the 2nd winner) is delearned by a smaller learning rate. RPCL can be regarded as an unsupervised extension of Kohonen's supervised LVQ2. RPCL has the ability to automatically allocate an appropriate number of units for an input data set. The experimental results show that RPCL outperforms FSCL when used for unsupervised classification, for training a radial basis function (RBF) network, and for curve detection in digital images