【24h】

A genetic clustering algorithm for searching the non-spherical-shape clusters

机译:寻找非球形聚类的遗传聚类算法

获取原文
获取原文并翻译 | 示例

摘要

The K-means algorithm is a well-known method for searching the clustering. However, the K-means algorithm is suitable to find the clustering that contains compact spherical clusters. If the shape of clusters is not spherical, the K-means algorithm is failure to find the clustering result. Therefore, in this study, the genetic clustering algorithm is proposed to find the clustering whether the shape of clusters is spherical or not. Also, the genetic clustering algorithm can automatically find the number of clusters in the data set. Thus, the users need not to pre-define the number of clusters in the data set. Experimental results show our proposed genetic clustering algorithm achieves better performance than the traditional clustering algorithms.
机译:K-means算法是搜索聚类的一种众所周知的方法。但是,K-means算法适合查找包含紧凑球形簇的簇。如果聚类的形状不是球形,则K-means算法将无法找到聚类结果。因此,在本研究中,提出了一种遗传聚类算法来寻找聚类的形状是否为球形的聚类。同样,遗传聚类算法可以自动找到数据集中的聚类数量。因此,用户无需预先定义数据集中的簇数。实验结果表明,本文提出的遗传聚类算法比传统聚类算法具有更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号