首页> 外文会议>2010 IEEE International Conference on Fuzzy Systems >Towards improved trapezoidal approximation to intersection (fusion) of trapezoidal fuzzy numbers: Specific procedure and general non-associativity theorem
【24h】

Towards improved trapezoidal approximation to intersection (fusion) of trapezoidal fuzzy numbers: Specific procedure and general non-associativity theorem

机译:朝梯形模糊数的交点(融合)的改进梯形近似:特定过程和一般非缔合性定理

获取原文

摘要

In some cases, our uncertainty about a quantity can be described by an interval of its possible values. If we have two or more pieces of interval information about the same quantity, then we can conclude that the actual value belongs to the intersection of these intervals. In general, we may need a fuzzy number to represent our partial knowledge. A fuzzy number can be viewed as a collection of intervals (α-cuts) corresponding to different degrees α ∊ [0,1]. In practice, we can only store finitely many α-cuts. Usually, we only store the lower and upper α-cuts (corresponding to α = 0 and α = 1) and use linear interpolation — i.e., use trapezoidal fuzzy numbers. However, the intersection of two trapezoidal fuzzy numbers is, in general, not trapezoidal. One possible approach is to simply take an intersection of lower and alpha α-cuts, but this approach underestimates the resulting membership function. In this paper, we propose a more accurate approach that uses the Least Squares Method to provide a better linear approximation to the resulting membership function. While this method provides a more accurate trapezoidal description of the intersection, it has its own drawbacks: e.g., this approximation method makes the corresponding “knowledge fusion” operation non-associative. We prove, however, that this “drawback” is inevitable: specifically, we prove that a perfect solution is not possible, and that any improved trapezoidal approximation to intersection (fusion) of trapezoidal fuzzy numbers leads to non-associativity.
机译:在某些情况下,我们对数量的不确定性可以用其可能值的间隔来描述。如果我们有两个或两个以上有关相同数量的间隔信息​​,则可以得出结论,实际值属于这些间隔的交集。通常,我们可能需要一个模糊数来表示我们的部分知识。模糊数可以看作是对应于不同程度α∊ [0,1]的间隔(α割)的集合。实际上,我们只能存储有限数量的α切口。通常,我们只存储上下切角(对应于α= 0和α= 1),并使用线性插值-即使用梯形模糊数。但是,两个梯形模糊数的交点通常不是梯形。一种可能的方法是简单地采用下切角和Alpha切角的交点,但是这种方法低估了所得的隶属度函数。在本文中,我们提出了一种更精确的方法,该方法使用最小二乘法为所得隶属函数提供更好的线性近似。尽管此方法提供了相交的更准确的梯形描述,但它也有其自身的缺点:例如,这种近似方法使相应的“知识融合”操作不具关联性。但是,我们证明了这种“缺点”是不可避免的:具体地说,我们证明了不可能找到完美的解决方案,并且梯形模糊数的交点(融合)的任何改进的梯形近似都会导致非缔合性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号