基于免疫粒子群优化的聚类算法  

Clustering Algorithm Based on Immune Particle Swarm Optimization

作　　者：郑晓鸣[1] 吕士颖[1] 王晓东[1] 

机构地区：[1]福州大学数学与计算机学院,福州350002

出　　处：《计算机工程》2008年第15期179-181,184,共4页Computer Engineering

基　　金：福建省自然科学基金资助项目(A0510008)

摘　　要：K均值算法简单快速,但其结果容易受初始聚类中心影响,并且容易陷入局部极值。该文结合粒子群优化算法和免疫系统中的免疫调节机制与免疫记忆功能对K均值算法进行改进,提出一种基于免疫粒子群优化的聚类算法。实验结果证明,该算法解决了K均值算法存在的对初值敏感的缺点,聚类结果稳定,而且比基于粒子群优化的聚类算法具有更好的聚类效果。K-means algorithm is simple and fast, however its result is affected by the initial clustering center and easily falls into the local optimum. This paper combines Particle Swarm Optimization（PSO） and adjusting mechanism and the immune memory function of immune system to improve K-means algorithm, and proposes a clustering algorithm based on Immune Particle Swarm Optimization algorithm（IM-PSO-KMEANS）. The experiments show that the IM-PSO-KMEANS algorithm overcomes the problems of K-means algorithm, and the results of clustering are better than algorithm based on PSO.

关 键 词：聚类 免疫粒子群优化 K均值 粒子群优化 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]