摘要
提出了一种基于改进的粒子群算法的聚类方法。该算法是将局部搜索能力强的K-均值算法和基于遗传算法的交叉、变异操作同时结合到粒子群算法中。既提高了粒子群算法的局部搜索能力、加快了收敛速度,同时因为加入了交叉、变异操作,有效地防治了早熟收敛现象的发生。实验表明该聚类算法有更好的收敛效果。
This paper proposes a clustering algorithm which is based on improved Particle Swarm Optimization(PSO).Both the K-means,which has strong capacity of local searching,and the cross,mutation operation,which are based on the genetic algorithm,are combined in the PSO algorithm.It not only improves the PSO's local searching capacity,accelerates the convergence rate,and effectively prevents the premature convergence,for it adds cross and mutation operations.Experiments show that this clustering algorithm has a better convergence.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第33期132-134,共3页
Computer Engineering and Applications
基金
国家自然科学基金No.60474070
No.10471036
湖南省科技计划项目(No.05FJ3074)
湖南省教育厅重点项目(No.07A001)~~
关键词
聚类分析
粒子群算法
K-均值算法
遗传算法
cluster analysis
particle swarm optimization algorithm
K-means
genetic algorithm