login

Deng entropy

Chaos Solitons & FractalsPublished 4 August 2016
Yong Deng
Citations431
SJR quartileQ1
SJR score1.18
SNIP1.54

Abstract

Dempster Shafer evidence theory has been widely used in many applications due to its advantages to handle uncertainty. However, how to measure uncertainty in evidence theory is still an open issue. The main contribution of this paper is that a new entropy, named as Deng entropy, is presented to measure the uncertainty of a basic probability assignment (BPA). Deng entropy is the generalization of Shannon entropy since the value of Deng entropy is identical to that of Shannon entropy when the BPA defines a probability measure. Numerical examples are illustrated to show the efficiency of Deng entropy.

Keywords

Computer ScienceDecision Sciences