Abstract
One of the most difficult problems in cluster analysis is how many clusters are appropriate for the description of a given system. In this paper, a novel dynamic genetic clustering algorithm (DGCA) is proposed to automatically search for the best number of clusters and the corresponding partitions. In the DGCA, a maximum attribute range partition approach is used in the population initialization in order to overcome the sensitivity of clustering algorithms to initial partitions. Furthermore, the methods of two-step selection and mutation operations are developed to exploit the search capability of the algorithm. Finally, the comparison among the DGCA, k-means algorithm and the standard genetic k-means clustering algorithm (SGKC) is illustrated with several artificial and real life data sets.
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.
