| 一种改进的粒子群和K均值混合聚类算法 |
| |
| 引用本文： | 陶新民, 徐晶, 杨立标, 刘玉. 一种改进的粒子群和K均值混合聚类算法[J]. 电子与信息学报, 2010, 32(1): 92-97. doi: 10.3724/SP.J.1146.2008.01698 |
| |
| 作者姓名： | 陶新民 徐晶 杨立标 刘玉 |
| |
| 作者单位： | 哈尔滨工程大学信息与通信工程学院,哈尔滨,150001;黑龙江科技学院数力系,哈尔滨,150027 |
| |
| 基金项目： | 哈尔滨工程大学校科研基金(002080260735);;黑龙江省博士后基金(LBH-Z08227)资助课题 |
| |
| 摘 要： | 该文针对K均值聚类算法存在的缺点,提出一种改进的粒子群优化(PSO)和K均值混合聚类算法。该算法在运行过程中通过引入小概率随机变异操作增强种群的多样性,提高了混合聚类算法全局搜索能力,并根据群体适应度方差来确定K均值算法操作时机,增强算法局部精确搜索能力的同时缩短了收敛时间。将此算法与K均值聚类算法、基于PSO聚类算法和基于传统的粒子群K均值聚类算法进行比较,数据实验证明,该算法有较好的全局收敛性,不仅能有效地克服其他算法易陷入局部极小值的缺点,而且全局收敛能力和收敛速度都有显著提高。
|
| 关 键 词： | K均值算法 粒子群优化算法 随机变异 适应度方差 |
| 收稿时间： | 2008-12-15 |
| 修稿时间： | 2009-06-15 |
Improved Cluster Algorithm Based on K-Means and Particle Swarm Optimization |
| |
| Tao Xin-min, Xu Jing, Yang Li-biao, Liu Yu. Improved Cluster Algorithm Based on K-Means and Particle Swarm Optimization[J]. Journal of Electronics & Information Technology, 2010, 32(1): 92-97. doi: 10.3724/SP.J.1146.2008.01698 |
| |
| Authors: | Tao Xin-min Xu Jing Yang Li-biao Liu Yu |
| |
| Affiliation: | College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001,China; Department of Mathematics and Mechanics, Heilongjiang Institute of Science and Technology, Harbin 150027,China |
| |
| Abstract: | To deal with the problem of premature convergence of the traditional K-means algorithm, a novel K-means cluster method based on the enhanced Particle Swarm Optimization(PSO) algorithm is presented. In this approach, the stochastic mutation operation is introduced into the PSO evolution, which reinforces the exploitation of global optimum of the PSO algorithm. In order to avoid the premature convergence and speed up the convergence, traditional K-means algorithm is used to explore the local search space more... |
| |
| Keywords: | K-means algorithm Particle Swarm Optimization(PSO) algorithm Stochastic mutation Fitness variance |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
|
