A Fast Approximate Reasoning Method in Hierarchical DSmT ( B)

LI Xin-de; YANG Wei-dong; WU Xue-jian; Jean Dezert

您当前的位置：

首页 >

文章列表页 >

A Fast Approximate Reasoning Method in Hierarchical DSmT ( B)

更新时间：2025-07-16

- A Fast Approximate Reasoning Method in Hierarchical DSmT ( B)
- Acta Electronica Sinica Vol. 39, Issue 3A, Pages: 31-36(2011)
- 作者机构：
  
  1. 东南大学自动化学院复杂工程测量与控制教育部重点实验室,江苏,南京,210096
  2. ONERA, 29 Av.de la Division, Leclerc, Chatillon,France,92320
  3. 东南大学自动化学院复杂工程测量与控制教育部重点实验室,江苏,南京,210096
  4. ONERA 29 Av.de la Division Leclerc Chatillon France,92320
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP391
- Published：2011
- 稿件说明：
移动端阅览
LI Xin-de, YANG Wei-dong, WU Xue-jian, et al. A Fast Approximate Reasoning Method in Hierarchical DSmT ( B)[J]. Acta Electronica Sinica, 2011, 39(3A): 31-36.
DOI：

LI Xin-de, YANG Wei-dong, WU Xue-jian, et al. A Fast Approximate Reasoning Method in Hierarchical DSmT ( B)[J]. Acta Electronica Sinica, 2011, 39(3A): 31-36. DOI：

摘要

针对Dezert-Smarandache Theory(DSmT)

随着鉴别框架中焦元数目的增多

其组合推理运算成指数增长

已成为制约该理论广泛应用与发展的瓶颈问题.为了解决这个难题

本文在进一步深入研究仅单子焦元赋值几个关键问题的基础上

主要针对超幂集空间中部分单子和冲突焦元具有信度赋值的情况

通过比例分配原则

把冲突焦元的信度赋值分配到相应的单子焦元上

然后根据仅单子焦元情形下的近似推理方法进行处理

即利用二叉树分组技术对单子焦元进行刚性分组

实现细粒度超幂集空间向粗粒度超幂集空间映射.最后通过从计算效率、信息损失和相似度的角度分别比较新、老方法

比较结果充分地验证了新方法的优越性.

Abstract

With the increment of focal element numbers in discernment framework

the computation amount in DSmT will exponentially go up

which has been the bottleneck problem to block the wide application and development of DSmT.To solve this problem

in this paper

on the base of further studying several key issues of hierarchical DSmT only with singletons

an extension is done to be fit for the case that there are singletons and conflicting focal elements with assignments in hyper-power set simultaneously.The conflicting focal elements are discoupled in terms of the proportion of assignments taken by elements involved in it.This is very helpful for further processing information according to the method only with singletons.That is

these discoupled focal elements in hyper-power set are forced to group through bintree to realize the mapping from the refined hyper-power set to the coarsened one.Finally

by comparing new method with old one from different views

i.e.computation effecieny

loss of information and similarity

the superiority of new one over old one is testified well.

关键词

Keywords

references

Views

1069

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Fast Approximate Reasoning Method in Hierarchical DSmT(A)

An DSmT Approximate Reasoning Method on the Condition of Non-zero Multiple Focal Elements

Dual Attention-Guided Detail and Structure Information Fusion Network for Image Dehazing

Research on Recombination Operator and Multi-Objective Optimization Based on Fitness Guided Mating Restriction Strategy

Dual-Domain Feature Interaction and Local Correlation Upsampling Network for Single Image Dehazing

Related Author

LI Xin-de

DEZERT Jean

HUANG Xin-han

MENG Zheng-da

WU Xue-jian

GUO Qiang

HE You

GUAN Xin

Related Institution

Key Laboratory of Measurement and Control of CSE (School of Automation,Southeast University),Ministry of Education.

ONERA(The French Aerospace Lab),29 Av.de la Division Leclerc,Chatillon

Department of Control Science and Control Engineering,Huazhong University of Science and Technology

Key Laboratory of Measurement and Control of CSE (School of AutomationSoutheast University)Ministry of Education.NanjingJiangsu 210096China

ONERA(The French Aerospace Lab)29 Av.de la Division LeclercChatillon 92320France

⁰