Structuring Bodies of Evidence

03/20/2013
by   Sandra Sandri, et al.
0

In this article we present two ways of structuring bodies of evidence, which allow us to reduce the complexity of the operations usually performed in the framework of evidence theory. The first structure just partitions the focal elements in a body of evidence by their cardinality. With this structure we are able to reduce the complexity on the calculation of the belief functions Bel, Pl, and Q. The other structure proposed here, the Hierarchical Trees, permits us to reduce the complexity of the calculation of Bel, Pl, and Q, as well as of the Dempster's rule of combination in relation to the brute-force algorithm. Both these structures do not require the generation of all the subsets of the reference domain.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/16/2003

Clustering belief functions based on attracting and conflicting metalevel evidence

In this paper we develop a method for clustering belief functions based ...
research
03/27/2013

Normalization and the Representation of Nonmonotonic Knowledge in the Theory of Evidence

We discuss the Dempster-Shafer theory of evidence. We introduce a concep...
research
03/20/2013

A Monte-Carlo Algorithm for Dempster-Shafer Belief

A very computationally-efficient Monte-Carlo algorithm for the calculati...
research
07/14/2012

Approximated Computation of Belief Functions for Robust Design Optimization

This paper presents some ideas to reduce the computational cost of evide...
research
03/27/2013

On the Combinality of Evidence in the Dempster-Shafer Theory

In the current versions of the Dempster-Shafer theory, the only essentia...
research
05/16/2003

Fast Dempster-Shafer clustering using a neural network structure

In this article we study a problem within Dempster-Shafer theory where 2...

Please sign up or login with your details

Forgot password? Click here to reset