基于APSO的模糊聚类算法  

Fuzzy Clustering Algorithm Based on APSO

作　　者：李金霞[1] 宋淑娜[1] 胡学坤[1] 高尚[1,2] 

机构地区：[1]江苏科技大学计算机科学与工程学院,镇江212003 [2]浙江大学CAD&CG国家重点实验室,杭州310027

出　　处：《科学技术与工程》2009年第19期5696-5699,共4页Science Technology and Engineering

基　　金：江苏省高校自然科学基础研究(08KJB520003);浙江大学CAD&CG国家重点实验室开放课题(A0704)资助

摘　　要：利用改进的自适应粒子群优化算法(APSO)较强全局寻优、快速收敛的特点和模糊C-均值算法(FCM)对初始值敏感、容易陷入局部最优的缺点。提出一种基于自适应粒子群优化算法的模糊聚类算法(APFM)。新算法有效的克服了FCM算法的缺点,同时增强了APSO算法全局搜索和跳出局部最优的能力。实验表明:新算法与单一的FCM和APSO算法相比聚类更准确,效率更高。By taking advantage of overall optimization, rapid convergence from improved APSO, and disadvantage of sensitive initial value and get lost into overall optimization easily from fuzzy C-mean algorithm, a new algorithm which is called APFM has been proposed based on APSO. This algorithm has overcome the disadvantage of FCM algorithm effectively; meanwhile, it has enhanced the capability of overall searching and local optimum jumping from APSO algorithm. According to the test, comparing with single FCM and APSO algorithm, this algorithm is more accurate in clustering and higher efficiency as well.

关 键 词：自适应粒子群优化算法 模糊聚类 模糊C-均值算法 

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