Skip to main content

Canonical Decomposition of Basic Belief Assignment for Decision-Making Support

  • Conference paper
  • First Online:
Modelling and Development of Intelligent Systems (MDIS 2020)

Abstract

We present a new methodology for decision-making support based on belief functions thanks to a new theoretical canonical decomposition of dichotomous basic belief assignments (BBAs) that has been developed recently. This decomposition based on proportional conflict redistribution rule no 5 (PCR5) always exists and is unique. This new PCR5-based decomposition method circumvents the exponential complexity of the direct fusion of BBAs with PCR5 rule and it allows to fuse quickly many sources of evidences. The method we propose in this paper provides both a decision and an estimation of the quality of the decision made, which is appealing for decision-making support systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    I.e. the solution, or the decision to take.

  2. 2.

    This is so-called Shafer’s model of FoD [5].

  3. 3.

    The complete ignorance is denoted \(\varTheta \) in Shafer’s book [1].

  4. 4.

    \(Disj(m_p,m_c)\) denotes symbolically the disjunctive fusion of \(m_p\) with \(m_c\).

  5. 5.

    Taking \(y=1\) would means that \(x(1-y)=0\) but \(m(A)=a\) with \(a\ne 0\) in general, so the choice of \(y=1\) is not possible.

  6. 6.

    The third equality \(m(A\cup \bar{A})=1-a-b=\frac{(1-x)(1-y)}{1-xy}\) being redundant with (10) and (11) is useless.

  7. 7.

    Otherwise the denominator of (10) and (11) will equal zero.

  8. 8.

    Because there is no simple analytical expressions for solutions x and y of PCR5-based canonical decomposition.

  9. 9.

    The solutions can be easily obtained with the roots command of Matlabâ„¢.

  10. 10.

    This point is not detailed here because is out of the scope of this paper.

  11. 11.

    Where the complexity is linear with the number of dichotomous BBAs to fuse.

  12. 12.

    For clarity, we need to introduce in the notations a superscript to indicate the FoD we are working on.

References

  1. Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  2. Zadeh, L.A.: On the validity of Dempster’s rule of combination. ERL Memo M79/24, Department of EECS, University of California, Berkeley, U.S.A. (1979)

    Google Scholar 

  3. Zadeh, L.A.: A simple view of the Dempster-Shafer theory of evidence and its implication for the rule of combination. Al Mag. 7(2), 85–90 (1986)

    Google Scholar 

  4. Dezert, J., Tchamova, A.: On the validity of Dempster’s fusion rule and its interpretation as a generalization of Bayesian fusion rule. Int. J. Intell. Syst. 29(3), 223–252 (2014)

    Article  Google Scholar 

  5. Smarandache, F., Dezert J. (eds.): Advances and Applications of DSmT for Information Fusion, vols. 1–4. American Research Press, Rehoboth (2004–2015)

    Google Scholar 

  6. Dezert, J., Smarandache, F.: Canonical decomposition of dichotomous basic belief assignment. Int. J. Intell. Syst. 35(7), 1105–1125 (2020)

    Article  Google Scholar 

  7. Smets, P.: The canonical decomposition of a weighted belief. In: Proceedings of International Joint Conference on Artificial Intelligence, San Mateo, CA, USA, pp. 1896–1901 (1995)

    Google Scholar 

  8. Yager, R.: On the Dempster-Shafer framework and new combination rules. Inf. Sci. 41, 93–138 (1987)

    Article  MathSciNet  Google Scholar 

  9. Dubois, D., Prade, H.: Representation and combination of uncertainty with belief functions and possibility measures. Comput. Intell. 4, 244–264 (1988)

    Article  Google Scholar 

  10. Dezert, J., Smarandache, F., Tchamova, A., Han, D.: Fast fusion of basic belief assignments defined on a dichotomous frame of discernment. In: Proceedings of Fusion 2020, Pretoria, South Africa (2020)

    Google Scholar 

  11. Dezert, J., Fidanova, S., Tchamova, A.: Fast BF-ICrA method for the evaluation of MO-ACO algorithm for WSN layout. In: Proceedings of FedCSIS International Conference, Sofia, Bulgaria (2020)

    Google Scholar 

  12. Han, D., Dezert, J., Yang, Y.: Belief interval based distances measures in the theory of belief functions. IEEE Trans. SMC 486, 833–850 (2018)

    Google Scholar 

  13. Smets, P., Kennes, R.: The transferable belief model. Artif. Intell. 66(2), 191–234 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Florentin Smarandache .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dezert, J., Smarandache, F. (2021). Canonical Decomposition of Basic Belief Assignment for Decision-Making Support. In: Simian, D., Stoica, L.F. (eds) Modelling and Development of Intelligent Systems. MDIS 2020. Communications in Computer and Information Science, vol 1341. Springer, Cham. https://doi.org/10.1007/978-3-030-68527-0_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68527-0_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68526-3

  • Online ISBN: 978-3-030-68527-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics