A Novel Method for Discrete Evidence Fusion Based on Dijkstra Shortest Path Algorithm

Discrete evidence generally exists in the fields of expert systems, pattern recognition, and decision processing. How to solve the fusion of discrete evidence is an open question. In order to solve the problem that the number of calculations increases exponentially with the increase of the number of discrete evidences, a method for calculating the shortest path based on Dijkstra is proposed. First, the normalized discrete evidence is decomposed into the exact value of the evidence as far as possible, and then the Jousselme distance between the two pairs of evidence between the evidence groups is calculated. The Jousselme distance is designed to measure the conflict between the evidence. Then the Dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme distance. The path here indicates the discrete evidence group with the largest fusion distance and smallest fusion distance. Then use Dempster combination to fuse the evidence after weighted average and give the interval value of BPA. Finally, two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.