首页> 外文会议>IEEE International Conference on Fuzzy Systems >Kernelized fuzzy c-means clustering for uncertain data using quadratic penalty-vector regularization with explicit mappings
【24h】

Kernelized fuzzy c-means clustering for uncertain data using quadratic penalty-vector regularization with explicit mappings

机译:使用二次惩罚 - 矢量正规与明确映射使用二次惩罚 - 矢量正规的核化模糊C-MEARIC

获取原文

摘要

Recently, fuzzy c-means clustering with kernel functions is remarkable in the reason that these algorithms can handle datasets which consist of some clusters with nonlinear boundaries. However the algorithms have the following problems: (1) the cluster centers can not be calculated explicitly, (2) it takes long time to calculate clustering results. By the way, we have proposed the clustering algorithms using penalty-vector regularization to handle uncertain data. In this paper, we propose new clustering algorithms using quadratic penalty-vector regularization by introducing explicit mappings of kernel functions to solve the following problems. Moreover, we construct fuzzy classification functions for our proposed clustering methods.
机译:最近,具有内核功能的模糊C-Means群集是显着的,因为这些算法可以处理由具有非线性边界的某些集群组成的数据集。然而,算法具有以下问题:(1)群集中心无法明确计算,(2)计算聚类结果需要很长时间。顺便说一下,我们已经建议使用惩罚矢量正规化来处理不确定数据的聚类算法。在本文中,我们通过引入内核函数的显式映射来解决新的群集算法来解决新的群集算法来解决以下问题。此外,我们为我们提出的聚类方法构建模糊分类功能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号