首页> 外文期刊>International Journal of Managing Information Technology >Extended PSO Algorithm for Improvement Problems K-Means Clustering Algorithm
【24h】

Extended PSO Algorithm for Improvement Problems K-Means Clustering Algorithm

机译:改进问题的扩展PSO算法K均值聚类算法

获取原文
       

摘要

The clustering is a without monitoring process and one of the most common data mining techniques. Thepurpose of clustering is grouping similar data together in a group, so were most similar to each other in acluster and the difference with most other instances in the cluster are. In this paper we focus on clusteringpartition k-means, due to ease of implementation and high-speed performance of large data sets, After 30year it is still very popular among the developed clustering algorithm and then for improvement problem ofplacing of k-means algorithm in local optimal, we pose extended PSO algorithm, that its name is ECPSO.Our new algorithm is able to be cause of exit from local optimal and with high percent produce theproblem’s optimal answer. The probe of results show that mooted algorithm have better performanceregards as other clustering algorithms specially in two index, the carefulness of clustering and the qualityof clustering.
机译:群集是一个无需监视的过程,也是最常见的数据挖掘技术之一。聚类的目的是将相似的数据分组到一个组中,因此在聚类中彼此最相似,并且与聚类中其他大多数实例的区别也很相似。由于易于实现和大数据集的高速性能,本文重点介绍了对分区k-means进行聚类的方法。30年后,它在已开发的聚类算法中仍然非常流行,然后又针对解决k-means算法在布局中的改进问题局部最优,我们提出了扩展的PSO算法,其名称为ECPSO。我们的新算法能够引起局部最优的退出,并且以较高的百分比产生问题的最优答案。实验结果表明,在聚类的谨慎性和聚类的质量这两个指标上,有争议的算法具有比其他聚类算法更好的性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号