No abstract

No abstract

No abstract

Dempster-Shafer evidence theory (D-S) is an effective instrument for merging the collected pieces of basic probability assignment (BPA), and it exhibits superiority in achieving robustness of soft computing and decision making in an uncertain and imprecise environment. However, the determination of BPA is still uncertain, and merely applying evidence theory can sometimes lead to counterintuitive results when lines of evidence conflict. In this paper, a novel BPA generation method for binary problems called the base algorithm is designed based on the kernel density estimation to construct probability density function models, using the pairwise learning