«上一篇/Previous Article|本期目录/Table of Contents|下一篇/Next Article»

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:

期数:

2013年09期

页码:

55-58

栏目:

智能、算法、系统工程

出版日期:

1900-01-01

文章信息/Info

Title:

K-Harmonic Means Clustering Algorithm Based on Genetic Algorithm

文章编号:

1673-629X（2013）09-0055-04

作者:

李家成; 苏一丹; 覃华; 吴丹

广西大学 计算机与电子信息学院

Author(s):

LI Jia-cheng; SU Yi-dan; QIN Hua; WU Dan

关键词:

遗传算法; K调和均值; 聚类

Keywords:

genetic algorithm; K-harmonic mean; clustering

文献标志码:

A

摘要:

K调和均值算法(KHM)用数据点与所有聚类中心的距离的调和平均值替代了数据点与聚类中心的最小距离，是一种对初始值不敏感、收敛速度快的有效聚类算法，但它容易陷入局部最小值。而遗传算法具有良好的全局优化能力。文中结合了KHM和遗传算法各自的优点，采用KHM计算每一代种群的聚类中心，并构造适应度函数，通过遗传算法进行一系列择优操作，成功地解决了KHM容易陷入局部最小值的问题。实验结果表明，所提出的算法不仅优化了聚类中心，而且还改善了聚类质量

Abstract:

In K-harmonic means clustering was an effective algorithm which was not sensitive to the initial value and converged quickly, it used harmonic means distance from the data point to all clustering centers to replace the minimum distance between the data point and all clustering centers. But it also easily converged to the local minimum,and genetic algorithm had a good global optimal capacity. Com-bined the advantages of KHM and genetic algorithm,used the KHM to calculate the clustering center of every population,and structure fitness function,through the genetic algorithm conduct a series of preferential operation,successfully solved the problem of KHM easily converged to the local minimum. The experiment showed the algorithm not only optimized the cluster centers,but also improved the clus-ter quality

常用功能

更新日期/Last Update: 1900-01-01