An optimal probabilistic transformation of belief functions based on artificial bee colony algorithm

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

One of the key issues in the applications of Dempster-Shafer evidence theory is how to make a decision based on Basic Probability Assignment (BPA). Besides the widely known pignistic transformation of belief functions, another conventional method is Plausibility Transformation, which transforms BPA to probability distribution by normalizing plausibility function of every singleton proposition. However, these two methods are stuck with the problem of impreciseness. To overcome this drawback, a new transformation method based on Artificial Bee Colony Algorithm is proposed. The obtained probability has the maximum correlation coefficient with the original BPA. Numerical examples are used to illustrate the efficiency of the proposed method. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Song, Y., Wang, X., Lei, L., & Xue, A. (2014). An optimal probabilistic transformation of belief functions based on artificial bee colony algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8588 LNCS, pp. 91–100). Springer Verlag. https://doi.org/10.1007/978-3-319-09333-8_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free