闫婷, 谢红薇. 混合细菌觅食和粒子群的k-means聚类算法[J]. 微电子学与计算机, 2016, 33(6): 59-62, 67.
引用本文: 闫婷, 谢红薇. 混合细菌觅食和粒子群的k-means聚类算法[J]. 微电子学与计算机, 2016, 33(6): 59-62, 67.
YAN Ting, XIE Hong-wei. Novel K-means Clustering Algorithm Combining Particle Swarm Optimization and Bacterial Foraging[J]. Microelectronics & Computer, 2016, 33(6): 59-62, 67.
Citation: YAN Ting, XIE Hong-wei. Novel K-means Clustering Algorithm Combining Particle Swarm Optimization and Bacterial Foraging[J]. Microelectronics & Computer, 2016, 33(6): 59-62, 67.

混合细菌觅食和粒子群的k-means聚类算法

Novel K-means Clustering Algorithm Combining Particle Swarm Optimization and Bacterial Foraging

  • 摘要: 针对传统k-means聚类算法中初值的敏感性, 容易陷入局部最优解的缺陷, 提出了一种优化初始聚类中心的k-means聚类算法.该算法将全局搜索能力强的粒子群算法与局部搜索能力强的细菌觅食算法结合, 将细菌的趋化行为简化为粒子群中粒子寻找最优解的过程, 再利用细菌完成复制、迁徙操作.将混合算法的最优解确定为初始聚类中心, 解决了k-means算法随机选择聚类中心的弊端.对Iris、Wine、Glass等UCI数据集的测试结果表明, 该算法的准确率和稳定性都高于流行的聚类算法, 能够更有效地解决复杂的优化问题.

     

    Abstract: This paper, we propose a novel clustering algorithm combining bacterial foraging algorithm (BFO) which has high global search ability with particle swarm algorithm (PSO)which has high local search ability based on the initial values of traditional k-means clustering algorithm is sensitive and easy to fall into local optimum solution, in order to optimize the initial cluster centers of K-means clustering algorithm. The chemotaxis of bacteria is simplified as the process of searching for the optimal solution of the particles in the particle swarm, and then the bacterias complete the further operation of reproduction and elimination-dispersal. The optimal solution of the hybrid algorithm is determined as the initial clustering center, and the disadvantages of the k-means algorithm are solved. The results on standard date set Iris, Wine, Glass of UCI display that the accuracy and stability of this proposed algorithm is higher than that of the popular clustering algorithms, at the same time, it can solve complex optimization problems most effectively.

     

/

返回文章
返回