Number of the records: 1
Local computations in Dempster-Shafer theory of evidence
- 1.
SYSNO ASEP 0382050 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Local computations in Dempster-Shafer theory of evidence Author(s) Jiroušek, Radim (UTIA-B) ORCID Number of authors 1 Source Title International Journal of Approximate Reasoning. - : Elsevier - ISSN 0888-613X
Roč. 53, č. 8 (2012), s. 1155-1167Number of pages 13 s. Language eng - English Country US - United States Keywords Discrete belief functions ; Dempster-Shafer theory ; conditional independence ; decomposable model Subject RIV IN - Informatics, Computer Science Institutional support UTIA-B - RVO:67985556 UT WOS 000309624800006 DOI 10.1016/j.ijar.2012.06.012 Annotation The paper studies a possibility of transferring ideas of local computations introduced in probability by Lauritzen and Spiegelhalter into Dempster–Shafer theory of evidence. The paper recalls decomposable models, discusses connection of the model structure with the corresponding system of conditional independence relations, and shows that under special additional conditions, one can locally compute specific basic assignments which can be considered to be conditional. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2013
Number of the records: 1