Iterative Approximation of Basic Belief Assignment Based on Distance of Evidence.
Ontology highlight
ABSTRACT: In the theory of belief functions, the approximation of a basic belief assignment (BBA) is for reducing the high computational cost especially when large number of focal elements are available. In traditional BBA approximation approaches, a focal element's own characteristics such as the mass assignment and the cardinality, are usually used separately or jointly as criteria for the removal of focal elements. Besides the computational cost, the distance between the original BBA and the approximated one is also concerned, which represents the loss of information in BBA approximation. In this paper, an iterative approximation approach is proposed based on maximizing the closeness, i.e., minimizing the distance between the approximated BBA in current iteration and the BBA obtained in the previ
SUBMITTER: Yang Y
PROVIDER: S-EPMC4735487 | biostudies-literature | 2016
REPOSITORIES: biostudies-literature
ACCESS DATA