基于遗传模拟退火算法的改进K-medoids算法  

Improved K-medoids algorithm based on genetic simulated annealing algorithm

作　　者：韩啸[1,2] 刘淑芬[1] 徐天琦[1] 

机构地区：[1]吉林大学计算机科学与技术学院,长春130012 [2]吉林大学学报编辑部,长春130012

出　　处：《吉林大学学报（工学版）》2015年第2期619-623,共5页Journal of Jilin University:Engineering and Technology Edition

基　　金：国家自然科学基金项目(60973041)

摘　　要：针对标准K-medoids算法在大数据聚类应用中易陷入局部最优解以及聚类效果受初始中心限制的缺点,提出了基于遗传模拟退火算法的K-medoids改进算法。该算法结合遗传算法和模拟退火算法,可以增强标准K-medoids算法在聚类时的全局搜索能力,并加快其收敛速度。对比实验证明:这一改进有效地弥补了标准K-medoids算法的上述缺陷,达到了提高聚类效率、加快收敛速度、改善聚类质量的目的。Standard K-medoids algorithm has the disadvantages of easy-to-fall into local optima and the clustering effect is commonly influenced by the initial cluster centre. To overcome these shortcomings,a modified K-medoids algorithm is proposed which is based on the genetic simulated annealing algorithm.By combing the genetic algorithm and the annealing algorithm,the global search ability and convergence speed of the proposed algorithm are greatly improved.Comparison experiment results show that the modified algorithm can effectively overcome the shortcomings of the Standard Kmedoids algorithm that the clustering efficiency,convergence speed and clustering quality are improved.

关 键 词：计算机应用 聚类 K-medoids算法 遗传模拟退火算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]