0481470 20240103214945.220171116235959.9 85031808792 000417659000004 10.1016/j.ijar.2017.10.010 17 s. P cav_un_epca*02567740888-613X921 (2018)49-65Elsevier Dempster-Shafer theory Dempster’s rule of combination Plausibility transform cav_un_auth*0101118 Department of Decision Making Theory 50 Jiroušek Radim UTIA-B Matematická teorie rozhodování Department of Decision Making Theory MTR MTR K Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0275452 Shenoy P. P. US http://library.utia.cas.cz/separaty/2017/MTR/jirousek-0481470.pdf cav_un_auth*0353269 GA15-00215S GA ČR CZ A new definition of entropy of basic probability assignments in the Dempster–Shafer theory of belief functions is proposed. We state a list of six desired properties of entropy for DS belief functions theory, four of which are motivated by Shannon’s definition of entropy of probability functions, and the remaining two are requirements that adapt this measure to the philosophy of the DS theory. The new definition has two components. The first component is Shannon’s entropy of an equivalent probability mass function obtained using the plausibility transform, which constitutes the conflict measure of entropy. The second component is Dubois-Prade’s definition of entropy of basic probability assignments in the DS theory, which constitutes the non-specificity measure of entropy. AH 50000 50200 50201 2019 2 RVO:67985556 http://hdl.handle.net/11104/0277040 cav_un_auth*0353454 School of Business, University of Kansas, US S 1* Article Computer Science Artificial Intelligence COMPUTERSCIENCE.ARTIFICIALINTELLIGENCE 2.200 0.707 7.8 0.00446 0.603 3587 0.606 1.604 150 Q3 43.815 44.4 Q3 Q2 0.65 Q2 44.403 2018 85031808792 SCOPUS PUBMED 000417659000004 WOS cav_un_epca*0256774 International Journal of Approximate Reasoning 0888-613X 1873-4731 Roč. 92 č. 1 2018 49 65 Elsevier