...
首页> 外文期刊>International Journal of Approximate Reasoning >Clustering decomposed belief functions using generalized weights of conflict
【24h】

Clustering decomposed belief functions using generalized weights of conflict

机译:使用冲突的广义权重对分解后的信念函数进行聚类

获取原文
获取原文并翻译 | 示例
           

摘要

We develop a method for clustering all types of belief functions, in particular non-consonant belief functions. Such clustering is done when the belief functions concern multiple events, and all belief functions are mixed up. Clustering is performed by decomposing all belief functions into simple support and inverse simple support functions that are clustered based on their pairwise generalized weights of conflict, constrained by weights of attraction assigned to keep track of all decompositions. The generalized conflict c ∈ (- ∞,∞) and generalized weight of conflict J~- ∈(- ∞,∞) are derived in the combination of simple support and inverse simple support functions.
机译:我们开发了一种对所有类型的信念函数(尤其是非辅音信念函数)进行聚类的方法。当置信函数涉及多个事件,并且所有置信函数混合在一起时,便完成了这种聚类。通过将所有置信函数分解为简单支持和逆简单支持函数来执行聚类,这些函数基于它们的成对的广义冲突权重进行聚类,并受分配以跟踪所有分解的吸引力的权重约束。通过简单支持和逆简单支持函数的组合推导广义冲突c∈(-∞,∞)和广义冲突权重J〜-∈(-∞,∞)。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号