The Maximum Deng Entropy

70Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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.

References Powered by Scopus

Fuzzy sets

72185Citations
6350Readers

This article is free to access.

Rough sets

14060Citations
461Readers
Get full text

Cited by Powered by Scopus

Get full text

Uncertainty measure in evidence theory

310Citations
52Readers
Get full text

Information Volume of Mass Function

177Citations
12Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kang, B., & Deng, Y. (2019). The Maximum Deng Entropy. IEEE Access, 7, 120758–120765. https://doi.org/10.1109/ACCESS.2019.2937679

Readers over time

‘19‘20‘21‘22‘23‘2401234

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 6

75%

Professor / Associate Prof. 1

13%

Lecturer / Post doc 1

13%

Readers' Discipline

Tooltip

Engineering 4

40%

Computer Science 3

30%

Mathematics 2

20%

Veterinary Science and Veterinary Medic... 1

10%

Save time finding and organizing research with Mendeley

Sign up for free
0