| 基于并行遗传算法的K-means聚类研究 |
| |
| 引用本文： | 戴文华,焦翠珍,何婷婷.基于并行遗传算法的K-means聚类研究[J].计算机科学,2008,35(6):171-174. |
| |
| 作者姓名： | 戴文华 焦翠珍 何婷婷 |
| |
| 作者单位： | 咸宁学院计算机系,湖北咸宁,437100;华中师范大学计算机科学系,武汉,430079 |
| |
| 基金项目： | 国家自然科学基金
,
国家社会科学基金
,
教育部科研项目
,
湖北省教育厅科研项目 |
| |
| 摘 要： | 针对传统K-means聚类算法对初始聚类中心的选择敏感,以及聚类数K难以确定的问题,提出一种基于并行遗传算法的K-means聚类方法.该方法采用一种新型的可变长染色体编码方案,随机选择样本点作为初始聚类中心形成染色体,然后结合K-means算法的高效性和并行遗传算法的全局优化能力,通过种群内的遗传、变异和种群间的并行进化、联姻,有效地避免了局部最优解的出现,同时得到了优化的聚类数目和聚类结果.实验表明该方法是一种精确高效的聚类方法.
|
| 关 键 词： | 并行遗传算法 可变长染色体编码 K-means算法 聚类 |
Research of K-means Clustering Method Based on Parallel Genetic Algorithm |
| |
| DAI Wen-hua,JIAO Cui-zhen,HE Ting-ting.Research of K-means Clustering Method Based on Parallel Genetic Algorithm[J].Computer Science,2008,35(6):171-174. |
| |
| Authors: | DAI Wen-hua JIAO Cui-zhen HE Ting-ting |
| |
| Affiliation: | DAI Wen-hua1 JIAO Cui-zhen1 HE Ting-ting2(Department of Computer,Xianning College,Xianning 437005,China)1(Department of Computer Science,Huazhong Normal University,Wuhan 430079,China)2 |
| |
| Abstract: | As K-means Clustering Algorithm is sensitive to the choice of the initial cluster centers and it's difficult to determine the cluster number, we propose a K-means Clustering Method Based on Parallel Genetic Algorithm. In the method, we adopt a new strategy of Variable-Length Chromosome Encoding and randomly chose initial clustering centers to form chromosomes among samples. Combining the efficiency of K-means Algorithm with the global optimization ability of Parallel Genetic Algorithm, the local optimal sol... |
| |
| Keywords: | Parallel genetic algorithm Variable-length chromosome encoding K-means algorithm Clustering |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
