Number of the records: 1  

Entropy for evaluation of Dempster-Shafer belief function models

  1. 1.
    0562467 - ÚTIA 2023 RIV US eng J - Journal Article
    Jiroušek, Radim - Kratochvíl, Václav - Shennoy, P. P.
    Entropy for evaluation of Dempster-Shafer belief function models.
    International Journal of Approximate Reasoning. Roč. 151, č. 1 (2022), s. 164-181. ISSN 0888-613X. E-ISSN 1873-4731
    Grant - others:GA ČR(CZ) GA19-06569S
    Program: GA
    Institutional support: RVO:67985556
    Keywords : Entropy * Belief functions * Compositional models
    OECD category: Statistics and probability
    Impact factor: 3.9, year: 2022
    Method of publishing: Limited access
    http://library.utia.cas.cz/separaty/2022/MTR/jirousek-0562467.pdf https://www.sciencedirect.com/science/article/pii/S0888613X22001463?via%3Dihub

    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.
    Permanent Link: https://hdl.handle.net/11104/0336395

     
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.