Fast algorithms for Dempster-Shafer theory

descriptionPublicationkeyboard_double_arrow_right Part of book or chapter of book , Conference object , Article 22 Nov 2005 Belgium English Publisher:Springer Science and Business Media LLC

Authors: Kennes, Robert; Smets, Philippe;

doi: 10.1007/bfb0028102

handle: 2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/260526

Fast algorithms for Dempster-Shafer theory

- Summary
- Subjects
- Metrics

Abstract

The runtime of the usual algorithms computing the transformation of a basic belief assignment into its associated belief function and conversely is an exponential function of the cardinality of (the domain of) the basic belief assignment. In this paper, new algorithms with a polynomial runtime are presented. These algorithms appear to be optimal in the class of the so-called M-algorithms.

Country

Belgium

Related Organizations

Université Libre de Bruxelles
Belgium

Keywords

Computational efficiency, Informatique générale, Möbius transformation, Informatique mathématique, Dempster-Shafer theory, Graph

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	11
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%

Found an issue? Give us feedback

11

Average

Top 10%

Upload OA version

Are you the author of this publication? Upload your Open Access version to Zenodo!

It’s fast and easy, just two clicks!

uploadUpload now