计算机应用 ›› 2014, Vol. 34 ›› Issue (4): 1065-1069.DOI: 10.11772/j.issn.1001-9081.2014.04.1065

• 人工智能 • 上一篇    下一篇

基于改进人工蜂群算法的K均值聚类算法

喻金平,郑杰,梅宏标   

  1. 江西理工大学 信息工程学院，江西 赣州 341000
  • 收稿日期:2013-10-24 修回日期:2013-12-11 发布日期:2014-04-29 出版日期:2014-04-01
  • 通讯作者: 郑杰
  • 作者简介:喻金平(1964-),男,江西南昌人,教授,主要研究方向:数据挖掘;
    郑杰(1990-),男,安徽六安人,硕士,主要研究方向:数据挖掘、群体智能;
    梅宏标(1976-),男,江西南昌人,副教授,博士,主要研究方向:大规模仿真系统工程。
  • 基金资助:

    江西省教育厅自然科学基金项目;江西省研究生创新专项基金项目

K-means clustering algorithm based on improved artificial bee colony algorithm

YU Jinping,ZHENG Jie,MEI Hongbiao   

  1. School of Information Engineering, Jiangxi University of Science and Technology, Ganzhou Jiangxi 341000, China
  • Received:2013-10-24 Revised:2013-12-11 Online:2014-04-29 Published:2014-04-01
  • Contact: ZHENG Jie

PDF

摘要：

针对K均值聚类(KMC)算法全局搜索能力差、初始聚类中心选择敏感,以及原始人工蜂群(ABC)算法的初始化随机性、易早熟、后期收敛速度慢等问题，提出了一种改进人工蜂群算法(IABC)。该算法利用最大最小距离积方法初始化蜂群,构造出适应KMC算法的适应度函数以及一种基于全局引导的位置更新公式以提高迭代寻优过程的效率。将改进的人工蜂群算法与KMC算法结合提出IABC-Kmeans算法以改善聚类性能。通过Sphere、Rastrigin、Rosenbrock和Griewank四个标准测试函数和UCI标准数据集上进行测试的仿真实验表明，IABC算法收敛速度快，克服了原始算法易陷入局部最优解的缺点；IABC-Kmeans算法则具有更好的聚类质量和综合性能。

Abstract:

In order to overcome the disadvantages of the K-Means Clustering (KMC) algorithm, such as the poor global search ability, being sensitive to initial cluster centroid, as well as the initial random, being vulnerable to trap in local optima and the slow convergence velocity in later period of the original Artificial Bee Colony (ABC) algorithm, an Improved ABC (IABC) algorithm was proposed. IABC algorithm adopted the max-min distance product algorithm for initial bee colony to form a fitness function, which is adapted to the KMC algorithm, and a position updating method based on the global leading to enhance the efficiency of the iterative optimization process. The combination of the IABC and KMC (IABC-Kmeans) would improve the efficiency of clustering. The simulation experiments were conducted on the four standard test functions including Sphere, Rastrigin, Rosenbrock and Griewank and the UCI standard data sets. The experimental results indicate that IABC algorithm has a fast convergence speed, and overcomes the defect of the original algorithm being easily falling into local optimal solution; IABC-Kmeans has better clustering quality and general performance.

中图分类号: 

版权所有 © 2021 四川计算机应用杂志社有限公司
蜀ICP备 05010208 号-3　新出网证(川)字026号
技术支持：北京玛格泰克科技发展有限公司
访问总数：
今日访问：