首页> 外文会议>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

机译:基于自适应群集合并的模糊古斯特港 - 凯尔斯尔算法推广

获取原文

摘要

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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号