A new computational measurement and optimization approach for DSmT

A great deal of interest has been paid to computation problem of Dezert-Smarandache theory (DSmT). But there are still problems on complex analysis and frequently search. The computational measurement of DSmT is presented in which the computation is generated in the search for focal elements, the combination of focal elements and basic belief assignment, the expression of focal elements. A new DSmT computational optimization approach is presented to solve the problems. The proposed approach optimizes the original evidence and combination of focal elements. The original evidence is reduced to keep the effective focal elements. And the focal element relationship is integrated into evidence code to realize self-adaption for combination of focal elements. Numerical results are provided to validate our approach.

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

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

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

[4]  Mathias Bauer,et al.  Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study , 1997, Int. J. Approx. Reason..

[5]  Jean Dezert,et al.  Foundations for a new theory of plausible and paradoxical reasoning , 2002 .

[6]  L. Hubert-Moy,et al.  Land cover change prediction with a new theory of plausible and paradoxical reasoning , 2003, Sixth International Conference of Information Fusion, 2003. Proceedings of the.

[7]  Arnaud Martin,et al.  Implementing general belief function framework with a practical codification for low complexity , 2008, ArXiv.

[8]  A Method for Managing Evidential Reasoning in a Hierarchical Hypothesis Space , 2008, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[9]  Xinde Li,et al.  An approximate reasoning method in Dezert-Smarandache Theory , 2009 .

[10]  Zhai Ding-jun.  Combination algorithm for evidence theory utilizing energy function , 2010 .

[11]  Wu Xue-jian.  A Fast Approximate Reasoning Method in Hierarchical DSmT(A) , 2010 .

[12]  Florentin Smarandache,et al.  AN INTRODUCTION TO DSmT FOR INFORMATION FUSION , 2012 .

[13]  Xinde Li,et al.  Evidence supporting measure of similarity for reducing the complexity in information fusion , 2011, Inf. Sci..

[14]  Deqiang Han,et al.  Hierarchical proportional redistribution principle for uncertainty reduction and BBA approximation , 2012, Proceedings of the 10th World Congress on Intelligent Control and Automation.

[15]  Deqiang Han,et al.  Hierarchical Proportional Redistribution for bba Approximation , 2012, Belief Functions.

[16]  Chongzhao Han,et al.  A novel approximation of basic probability assignment based on rank-level fusion , 2013 .

[17]  Jean Dezert,et al.  Partial Ordering on Hyper-Power Sets , 2016 .

[18]  Jean Dezert,et al.  Presentation of DSmT , 2016 .