Abstract
This paper introduces and discusses some competitive learning algorithms for complex data clustering. A new competitive learning algorithm, named the dynamically penalized rival competitive learning algorithm (DPRCL), is introduced and studied. It is a variant of the rival penalized competitive algorithm and it performs appropriate clustering without knowing the number of clusters, by automatically driving the extra seed points far away from the input data set. It doesn't have the dead units problem. The results of simulations, performed in different conditions, are presented, showing that the performance of the new DPRCL algorithm is better if compared with other competitive algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
