聚类问题的自适应杂交差分演化模拟退火算法  

Cluster analysis based on self-adaptive hybrid differential evolution with simulated annealing algorithm

作　　者：苏清华[1,2] 胡中波[1] 熊一能[1] 

机构地区：[1]孝感学院数学系,湖北孝感432000 [2]华中科技大学数学系,武汉430074

出　　处：《计算机工程与应用》2010年第23期41-43,78,共4页Computer Engineering and Applications

基　　金：国家重点基础研究发展规划(973)No.2004CCA02500;国家自然科学基金No.60572015;武汉市科技攻关项目(No.200770834318);湖北省教育厅优秀中青年人才项目(No.Q200726003)~~

摘　　要：针对K-均值聚类算法对初始值敏感和易陷入局部最优的缺点,提出了一个基于自适应杂交差分演化模拟退火的K-均值聚类算法。该算法以差分演化算法为基础,通过模拟退火算法的更新策略来增强全局搜索能力,并运用自适应技术来选择学习策略、确定算法的关键参数。实验结果表明,该算法能较好地克服传统K-均值聚类算法的缺点,具有较好的全局收敛能力,且算法稳定性强、收敛速度快,将新算法与传统的K-均值聚类算法以及最近提出的几个同类聚类算法进行了比较。The classical k-means clustering runs the risk of being trapped by local optima and its initial classical centers are difficulty in being set.In this paper,a novel k-means cluster analysis algorithm based on self-adaptive hybrid differential evolution with simulated annealing algorithm is proposed to overcome the disadvantage of the classical k-means algorithm.In the proposed algorithm,the choice of learning strategy and several critical control parameters are not required to be pre-specified. During evolution,the suitable learning strategy and parameters setting are gradually self-adapted according to the learning experience.With the aid of simulated annealing strategy,the proposed algorithm is able to improve the global search ability of conventional differential evolution algorithm.Numerical experiment results show that the new algorithms could overcome the faults of the classical k-means algorithm,and converge quickly.Comparative study exposes the two proposed algorithms as competitive algorithms for clustering.

关 键 词：聚类分析 差分演化算法 模拟退火算法 自适应技术 K-均值聚类算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构] O213[自动化与计算机技术—计算机科学与技术]