首页> 外文会议>IEEE International Conference on Fuzzy Systems >Improved Online Fuzzy Clustering Based on Unconstrained Kernels
【24h】

Improved Online Fuzzy Clustering Based on Unconstrained Kernels

机译:基于无规定内核的在线模糊聚类改进

获取原文

摘要

A novel fuzzy clustering algorithm is presented in this paper, which removes the constraints generally imposed to the cluster shape when a given model is adopted for membership functions. An on-line, sequential procedure is proposed where the cluster determination is performed by using suited membership functions based on geometrically unconstrained kernels and a point-to-shape distance evaluation. Since the performance of on-line algorithms suffers from the pattern presentation order, we also consider the problem of cluster validity aiming at proving the minimal dependence and the robustness with respect to the initialization of inner parameters in the proposed algorithm. The numerical results reported in the paper prove that the proposed approach is able to improve the performances of well-known algorithms on some reference benchmarks.
机译:本文提出了一种新型模糊聚类算法,其在采用给定模型以进行成员资格函数时,将通常施加到簇形状的约束。 在线,提出了通过使用基于几何无约束内核和点对形距离评估来执行群集确定来执行群集确定的串行过程。 由于在线算法的性能存在模式呈现顺序,我们还考虑了旨在证明所提出的算法中内部参数初始化的最小依赖和鲁棒性的集群有效性问题。 本文报告的数值结果证明,该方法能够在一些参考基准测试中提高众所周知的算法的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号