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”

On Open Problems Associated with Conditioning in the Dempster-Shafer Belief Function Theory

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F23%3A00576517" target="_blank" >RIV/67985556:_____/23:00576517 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    On Open Problems Associated with Conditioning in the Dempster-Shafer Belief Function Theory

  • Original language description

    As in probability theory, graphical and compositional models in the Dempster-Shafer (D-S) belief function theory handle multidimensional belief functions applied to support inference for practical problems. Both types of models represent multidimensional belief functions using their low-dimensional marginals. In the case of graphical models, these marginals are usually conditionals, for compositional models, they are unconditional. Nevertheless, one must introduce some conditioning to compose unconditional belief functions and avoid double-counting knowledge. Thus, conditioning is crucial in processing multidimensional compositional models for belief functions.nnThis paper summarizes some important open problems, the solution of which should enable a trouble-free design of computational processes employing D-S belief functions in AI. For some of them, we discuss possible solutions. The problems considered in this paper are of two types. There are still some gaps that should be filled to get a mathematically consistent uncertainty theory. Other problems concern the computational tractability of procedures arising from the super-exponential growth of the space and time complexity of the designed algorithms.

  • Czech name

  • Czech description

Classification

  • Type

    O - Miscellaneous

  • CEP classification

  • OECD FORD branch

    10103 - Statistics and probability

Result continuities

  • Project

    <a href="/en/project/GA21-07494S" target="_blank" >GA21-07494S: Efficiency of Carbon Reduction Policies</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • Confidentiality

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