首页> 外文会议>IFSA World Congress and 20th NAFIPS International Conference, 2001. Joint 9th >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 the various methods of fuzzy cluster analysis. L/sub 1/-based fuzzy c-means has also been studied in recent years. This paper discusses the L/sub 1/-based fuzzy c-means of data with fuzzy uncertainties. The data unit is supposed to be the Cartesian product of fuzzy numbers. The metric between a data unit with uncertainty and a cluster center is defined using minimum and maximum distances. The fuzzy c-means algorithm is an alternative procedure for the optimization of the cluster center and the fuzzy set membership, while the solution of the cluster center for uncertain data cannot be obtained directly. An algorithm for the solution of cluster centers based on the L/sub 1/ metric for uncertain data is developed in this paper. Using this algorithm, an exact alternate optimization procedure is obtained. Numerical examples show that the results for uncertain data are different from the results for data without uncertainties.
机译:在模糊聚类分析的各种方法中,模糊c均值是众所周知的。近年来还研究了基于L / sub 1 /的模糊c均值。本文讨论了具有模糊不确定性的基于L / sub 1 /的数据模糊c-均值。该数据单元应该是模糊数的笛卡尔积。使用最小和最大距离定义不确定性数据单元与聚类中心之间的度量。模糊c均值算法是优化聚类中心和模糊集隶属度的一种替代方法,而聚类中心的不确定数据无法直接获得。提出了一种基于L / sub 1 /度量的不确定数据聚类中心求解算法。使用此算法,可以获得精确的替代优化过程。数值示例表明,不确定数据的结果与无不确定数据的结果不同。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号