YE Zhi-wei, YIN Yu-jie, WANG Ming-wei, ZHAO Wei. A Clustering Approach Based on Cuckoo Search Algorithm[J]. Microelectronics & Computer, 2015, 32(5): 104-110. DOI: 10.19304/j.cnki.issn1000-7180.2015.05.022
Citation: YE Zhi-wei, YIN Yu-jie, WANG Ming-wei, ZHAO Wei. A Clustering Approach Based on Cuckoo Search Algorithm[J]. Microelectronics & Computer, 2015, 32(5): 104-110. DOI: 10.19304/j.cnki.issn1000-7180.2015.05.022

A Clustering Approach Based on Cuckoo Search Algorithm

  • Due to the influence of initial class centers K-Means algorithm is easy to fall into local optimal clustering result. K-Means based on Genetic Algorithm and particle swarm optimization algorithm could improve the performance of the basic K-Means in a certain extent, however, Genetic Algorithm and particle swarm optimization algorithm themselves are easy to fall into local optimal solution too. Thus, in the paper, a clustering method based on K-means clustering algorithm and cuckoo search algorithm is presented, which is able to overcome the drawbacks of basic K-means clustering algorithm. Further, the proposed approach has been compared with K-means clustering algorithm optimized by genetic algorithm and particle swarm optimization algorithm. The experimental results show that the method can effectively improve the shortcoming of k-means algorithm, which is a robust clustering method and has better global search capability in comparison with K-means clustering algorithm based on genetic algorithm and particle swarm optimization algorithm.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return