Efficient computation of belief theoretic conditionals

Research output: Contribution to conferencePaper

2 Scopus citations

Abstract

Dempster-Shafer (DS) belief theory is a powerful general framework for dealing with a wider variety of uncertainties in data. As in Bayesian probability theory, the conditional operation plays a critical role in DS theoretic strategies for evidence updating and fusion. A major limitation associated with the application of DS theoretic techniques for reasoning under uncertainty is the absence of a feasible computational framework to overcome the prohibitive computational burden this conditional operation entails. This paper addresses this critical challenge via a novel generalized conditional computational model - DS-Conditional-One - which allows the conditional to be computed in significantly less computational and space complexity. This computational model also provides valuable insight into the DS theoretic conditional itself and can be utilized as a tool for visualizing the conditional computation. We provide a thorough analysis and experimental validation of the utility, efficiency, and implementation of the proposed data structures and algorithms for carrying out both the Dempster's conditional and Fagin-Halpern conditional, the two most widely utilized DS theoretic conditional strategies.

Original languageEnglish (US)
Pages265-276
Number of pages12
StatePublished - Jan 1 2019
Event10th International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2017 - Lugano, Switzerland
Duration: Jul 10 2017Jul 14 2017

Conference

Conference10th International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2017
CountrySwitzerland
CityLugano
Period7/10/177/14/17

Keywords

  • Algorithms
  • Computational complexity
  • Data structures
  • Dempster's conditional
  • Dempster-Shafer belief theory
  • Fagin-Halpern conditional

ASJC Scopus subject areas

  • Statistics and Probability

Fingerprint Dive into the research topics of 'Efficient computation of belief theoretic conditionals'. Together they form a unique fingerprint.

  • Cite this

    Polpitiya, L. G., Premaratne, K., Murthi, M. N., & Sarkar, D. (2019). Efficient computation of belief theoretic conditionals. 265-276. Paper presented at 10th International Symposium on Imprecise Probability: Theories and Applications, ISIPTA 2017, Lugano, Switzerland.