首页> 外文会议>International Fuzzy Systems Association World Congress >Fuzzy clustering of data with uncertainties using minimum and maximum distances based on L{sub}1 metric
【24h】

Fuzzy clustering of data with uncertainties using minimum and maximum distances based on L{sub}1 metric

机译:使用基于L {Sub} 1度量的最小和最大距离的不确定性的数据模糊聚类

获取原文

摘要

Fuzzy c-means is well-known among various methods of fuzzy cluster analysis. L1 based fuzzy c means is also studied in recent years. The aim of the present paper is to discuss L1 based fuzzy c-means of data with fuzzy uncertainties. Data unit is suposed to be Cartesian product of fuzzy numbers. The metric between a data unit with uncertainty and a cluster center is defined using Minimum and Maximum Distances. Fuzzy c-means algorithm is altenate optimization procedure of the cluster center and the membership, while the solutions of cluster center for the data with uncertainties can not be obtained directly. The algorithm for the solution of cluster centers based on L1 metric for the data with uncertainties are developed in this paper. Using this algorithm, exact alternate optimization procedure is obtained. Numerical examples show that the results for the data with uncertainties are different from the results for the data without uncertainties.
机译:模糊C-Mance是众所周知的模糊聚类分析方法。近年来,基于L1的模糊C手段也研究。本文的目的是讨论基于L1的模糊C型数据,具有模糊不确定性。数据单元被视为模糊数字的笛卡尔乘积。使用最小和最大距离定义具有不确定性和集群中心的数据单元之间的度量。模糊C-Means算法是集群中心和成员的亚通型优化程序,而无法直接获得带有不确定性的数据集群中心的解决方案。本文开发了基于L1度量的基于L1度量的集群中心解决的算法。使用该算法,获得了精确的备用优化过程。数值示例表明,具有不确定性的数据的结果与数据的结果不同,没有不确定性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号