基于人工蜂群与K-Means的改进混合聚类算法  

Improved Hybrid Clustering Algorithm Based on Artificial Bee Colony Algorithm and K-Means Algorithm

作　　者：包婉莹 罗小玲[1] 潘新[1] 

机构地区：[1]内蒙古农业大学,计算机与信息工程学院,内蒙古 呼和浩特

出　　处：《人工智能与机器人研究》2020年第2期92-99,共8页Artificial Intelligence and Robotics Research

基　　金：国家自然科学基金(No. 61962048, No. 61562067)。

摘　　要：为了克服K-Means聚类算法过度依赖初始聚类中心、容易陷入局部最优的缺点以及人工蜂群算法因为搜索策略的局限而导致的易早熟,收敛速度慢的问题,提出了改进的全局人工蜂群算法与K-Means++算法相结合的混合聚类方法,充分利用改进的全局人工蜂群算法可以全局寻优的特点与K-Means++算法能够优化初始聚类中心位置并且收敛速度快的特点,将二者融合,使得K-Means可以进行全局搜索,跳出局部最优解,并用UCI数据库中的Wine数据集和Balance-Scale数据集进行实验。结果表明,改进的全局人工蜂群算法较标准人工蜂群算法收敛速度更快,寻优效果更好;本文提出的混合聚类算法与原始K-Means算法相比,稳定性更好,迭代次数减少,收敛速度更快,而且聚类效果也有了明显改善。In order to overcome the disadvantages of K-Means clustering algorithm, such as over dependence on the initial clustering center, easily falling into local optimum, and the premature and slow con-vergence of the artificial bee colony algorithm due to the limitations of search strategies, a hybrid clustering method combining the improved global artificial bee colony algorithm and K-Means++ algorithm is proposed, which makes full use of the characteristics of the improved global artificial bee colony algorithm and K-Means++ algorithm. It can optimize the location of the initial clustering center and the convergence speed is fast. By combining the two, K-Means can search globally and jump out of the local optimal solution. The experiments are carried out with the Wine data set and balance-Scale data set in the UCI database. The results show that the improved global artificial bee colony algorithm has faster convergence speed and better optimization effect than the standard artificial bee colony algorithm. Compared with the original K-Means algorithm, the hybrid clustering algorithm proposed in this paper has better stability, fewer iterations, faster conver-gence speed and better clustering effect.

关 键 词：全局人工蜂群算法 K-MEANS 适应度函数 聚类分析 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]