首页> 外文会议>IEEE MIT Undergraduate Research Technology Conference >Extension of fuzzy Gustafson-Kessel algorithm based on adaptive cluster merging
【24h】

Extension of fuzzy Gustafson-Kessel algorithm based on adaptive cluster merging

机译:基于自适应聚类的模糊Gustafson-Kessel算法扩展

获取原文

摘要

The performance of objective function-based fuzzy clustering algorithms depends on the shape and the volume of the clusters, the initialization of the clustering algorithm, the distribution of the data objects, and the number of clusters contained in the data. We propose an extension of Gustafson- Kessel (FGK) fuzzy algorithm by developing adaptive validation criteria for merging of clusters during the unsupervised learning. There are no mathematical methods for solving this optimization task analytically. The performance of the proposed approach was examined on generated and benchmark data sets, and compared to those received by respective fuzzy counterparts. Additionally, its efficiency was tested on data collected from some current real world applications.
机译:基于目标函数的模糊聚类算法的性能取决于聚类的形状和数量,聚类算法的初始化,数据对象的分布以及数据中包含的聚类数量。我们提出了一种扩展Gustafson-Kessel(FGK)模糊算法的方法,该方法是通过开发在无监督学习期间合并集群的自适应验证标准来实现的。没有数学方法可以解析地解决此优化任务。在生成的数据和基准数据集上检查了所提出方法的性能,并与相应的模糊对口所收到的数据进行了比较。此外,它的效率还通过从一些当前实际应用程序中收集的数据进行了测试。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号