All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Entropy for evaluation of Dempster-Shafer belief function models

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F22%3A00562467" target="_blank" >RIV/67985556:_____/22:00562467 - isvavai.cz</a>

  • Alternative codes found

    RIV/61384399:31160/22:00058379

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0888613X22001463?via%3Dihub" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0888613X22001463?via%3Dihub</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ijar.2022.09.009" target="_blank" >10.1016/j.ijar.2022.09.009</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Entropy for evaluation of Dempster-Shafer belief function models

  • Original language description

    Applications of Dempster-Shafer (D-S) belief functions to practical problems involve difficulties arising from their high computational complexity. One can use space-saving factored approximations such as graphical belief function models to solve them. Using an analogy with probability distributions, we represent these approximations in the form of compositional models. Since no theoretical apparatus similar to probabilistic information theory exists for D-S belief functions (e. g., dissimilarity measure analogous to the Kullback-Liebler divergence measure), the problems arise not only in connection with the design of algorithms seeking optimal approximations but also in connection with a criterion comparing two different approximations. In this respect, the application of the analogy with probability theory fails. Therefore, in this paper, we conduct some synthetic experiments and describe the results designed to reveal whether some belief function entropy definitions described in the literature can detect optimal approximations, i.e., that achieve their minimum for an optimal approximation.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10103 - Statistics and probability

Result continuities

  • Project

    <a href="/en/project/GA19-06569S" target="_blank" >GA19-06569S: Managerial Decisions: Rationality of Paradoxical Behavior</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Approximate Reasoning

  • ISSN

    0888-613X

  • e-ISSN

    1873-4731

  • Volume of the periodical

    151

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    18

  • Pages from-to

    164-181

  • UT code for WoS article

    000876728600008

  • EID of the result in the Scopus database

    2-s2.0-85138797457