Hierarchical proportional redistribution principle for uncertainty reduction and BBA approximation

Dempster-Shafer evidence theory is very important in the fields of information fusion and decision making. However, it always brings high computational cost when the frames of discernments to deal with become large. To reduce the heavy computational load involved in many rules of combinations, the approximation of a general belief function is needed. In this paper we present a new general principle for uncertainty reduction based on hierarchical proportional redistribution (HPR) method which allows to approximate any general basic belief assignment (bba) at a given level of non-specificity, up to the ultimate level 1 corresponding to a Bayesian bba. The level of non-specificity can be adjusted by the users. Some experiments are provided to illustrate our proposed HPR method.

[1]  D. Dubois,et al.  An alternative approach to the handling of subnormal possibility distributions , 1987 .

[2]  Frans Voorbraak,et al.  A Computationally Efficient Approximation of Dempster-Shafer Theory , 1988, Int. J. Man Mach. Stud..

[3]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[4]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[5]  Serafín Moral,et al.  A Monte Carlo Algorithm for Combining Dempster-Shafer Belief Based on Approximate Pre-computation , 1999, ESCQARU.

[6]  Thierry Denœux,et al.  Inner and outer approximation of belief structures using a hierarchical clustering approach , 2001 .

[7]  Fabio Cuzzolin,et al.  Two k-additive generalizations of the pignistic transform for imprecise decision making , 2011 .

[8]  Éloi Bossé,et al.  A new distance between two bodies of evidence , 2001, Inf. Fusion.

[9]  Robert Kennes,et al.  Computational aspects of the Mobius transformation of graphs , 1992, IEEE Trans. Syst. Man Cybern..

[10]  Glenn Shafer,et al.  Implementing Dempster's Rule for Hierarchical Evidence , 1987, Artif. Intell..

[11]  Florentin Smarandache,et al.  Advances and Applications of DSmT for Information Fusion (Collected Works) , 2004 .

[12]  Philippe Smets,et al.  Computational Aspects of the Mobius Transform , 2013, ArXiv.

[13]  Michel Grabisch.  Upper Approximation of Non-additive Measures by k-additive Measures --- The Case of Belief Functions , 1999, ISIPTA.

[14]  D. Dubois,et al.  A NOTE ON MEASURES OF SPECIFICITY FOR FUZZY SETS , 1985 .

[15]  Thomas Burger.  Defining new approximations of belief function by means of Dempster's combination , 2010 .

[16]  Philippe Smets,et al.  Practical Uses of Belief Functions , 1999, UAI.

[17]  Jean Dezert,et al.  Applications and Advances of DSmT for Information Fusion , 2004 .

[18]  Bjørnar Tessem,et al.  Approximations for Efficient Computation in the Theory of Evidence , 1993, Artif. Intell..

[19]  Jeffrey A. Barnett,et al.  Computational Methods for a Mathematical Theory of Evidence , 1981, IJCAI.

[20]  Thierry Denoeux,et al.  Inner and Outer Approximation of Belief Structures Using a Hierarchical Clustering Approach , 2001, Int. J. Uncertain. Fuzziness Knowl. Based Syst..