4.6 Article

The Maximum Deng Entropy

期刊

IEEE ACCESS
卷 7, 期 -, 页码 120758-120765

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2937679

关键词

Entropy; Deng entropy; Shannon entropy; maximum entropy; Dempster-Shafer evidence theory; maximum belief entropy

资金

  1. National Natural Science Foundation of China [61573290, 61973332, 30400067, 60874105, 61174022]
  2. Shanghai Jiao Tong University [T241460612]
  3. Program for New Century Excellent Talents in University [NCET-08-0345]
  4. Shanghai Rising-Star Program [09QA1402900]
  5. Chongqing Natural Science Foundation for Distinguished Scientist [CSCT 2010BA2003]

向作者/读者索取更多资源

Deng entropy has been proposed to measure the uncertainty degree of basic probability assignment in evidence theory. In this paper, the condition of the maximum of Deng entropy is discussed. According to the proposed theorem of the maximum Deng entropy, we obtain the analytic solution of the maximum Deng entropy, which yields that the most information volume of Deng entropy is bigger than that of the previous belief entropy functions. Some numerical examples are used to illustrate the basic probability assignment with the maximum Deng entropy.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据