On Open Problems Connected with Application of the Iterative Proportional Fitting Procedure to Belief Functions

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F13%3A00395348" target="_blank" >RIV/67985556:_____/13:00395348 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61384399:31160/13:00042500

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

On Open Problems Connected with Application of the Iterative Proportional Fitting Procedure to Belief Functions

Popis výsledku v původním jazyce

In probability theory, Iterative Proportional Fitting Procedure can be used for construction of a joint probability measure from a system of its marginals. The present paper studies a possibility of application of an analogous procedure for belief functions, which was made possible by the fact that there exist operators of composition for belief functions. In fact, two different procedures based on two different composition operators are introduced. The procedure based on the composition derived from the Dempster's rule of combination is of very high computationally complexity and, from the theoretical point of view, practically nothing is known about its behavior. The other one, which uses the composition derived from the notion of factorization, is much more computationally efficient, and its convergence is guaranteed by a theorem proved in this paper.

Název v anglickém jazyce

On Open Problems Connected with Application of the Iterative Proportional Fitting Procedure to Belief Functions

Popis výsledku anglicky

In probability theory, Iterative Proportional Fitting Procedure can be used for construction of a joint probability measure from a system of its marginals. The present paper studies a possibility of application of an analogous procedure for belief functions, which was made possible by the fact that there exist operators of composition for belief functions. In fact, two different procedures based on two different composition operators are introduced. The procedure based on the composition derived from the Dempster's rule of combination is of very high computationally complexity and, from the theoretical point of view, practically nothing is known about its behavior. The other one, which uses the composition derived from the notion of factorization, is much more computationally efficient, and its convergence is guaranteed by a theorem proved in this paper.

Druh

D - Stať ve sborníku

CEP obor

BA - Obecná matematika

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2013

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proceedings of the Eighth International Symposium on Imprecise Probability: Theories adn Applications

ISBN

978-2-913923-35-5

ISSN

—

e-ISSN

—

Počet stran výsledku

9

Strana od-do

149-158

Název nakladatele

Society for Imprecise Probability: Theories and Applications

Místo vydání

Compiegne

Místo konání akce

Compiegne

Datum konání akce

2. 7. 2013

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—