2003
DOI: 10.1002/int.10073
|View full text |Cite
|
Sign up to set email alerts
|

Implementing belief function computations

Abstract: This article discusses several implementation aspects for Dempster-Shafer belief functions. The main objective is to propose an appropriate representation of mass functions and efficient data structures and algorithms for the two basic operations of combination and marginalization.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2007
2007
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(10 citation statements)
references
References 18 publications
0
10
0
Order By: Relevance
“…By using plausibilities p Ω , the complexity is O(2 |Ω| T) [28]. As a recommendation, when |Ω| is large, it is preferable to avoid matrix calculus and use the binary format as means to encode focal elements [71], -Finally, it is assumed that sensors required for measuring the effectiveness are available. First, it might not be the case and one needs to assess cost/benefits of adding the required sensors.…”
Section: Discussionmentioning
confidence: 99%
“…By using plausibilities p Ω , the complexity is O(2 |Ω| T) [28]. As a recommendation, when |Ω| is large, it is preferable to avoid matrix calculus and use the binary format as means to encode focal elements [71], -Finally, it is assumed that sensors required for measuring the effectiveness are available. First, it might not be the case and one needs to assess cost/benefits of adding the required sensors.…”
Section: Discussionmentioning
confidence: 99%
“…Computationally, D-S networks are more expensive to evaluate than Bayesian networks [16,43]. The worst-case complexity of a Bayesian network is O(n), whereas the worst-case complexity of a D-S network is O(2 n ), with n the dimension of the state space of the largest clique in the join tree 5 [16].…”
Section: Computational Efficiencymentioning
confidence: 99%
“…An alternative way that permits directly computing the bpa of an element A = ( A 1 , A 2 , …, A k ) of P ( Z ) is based on the application of the Dempster rule to the cylindrical extensions of the power sets elements. ( 26 ) The cylindrical extension A i ↑ of an element A i of Z i over Z is defined by considering for the variables x 1 , x 2 , …, x i −1 , x i +1 , …, x k their entire UODs: …”
Section: The Multiple‐assumptions Multiple‐experts Model Uncertainmentioning
confidence: 99%