Abstract
DSmT can solve the problems of high conflict evidence combination, but it has the disadvantage that the calculation is too large and the mass value of main element is difficult to converge. In order to solve this problem, a fast mass function convergence algorithm was proposed, which just calculates the basic belief of the single element in the frame of discernment to normalize them, and then rebuild the mass value, thus it can greatly reduce the calculation and make the mass function quickly converge to a certain threshold, which is convenient to quickly and exactly recognize and sort the targets. The comparison and simulation computation example have proved the validity of this algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 89-92 |
| Number of pages | 4 |
| Journal | Hunan Daxue Xuebao/Journal of Hunan University Natural Sciences |
| Volume | 38 |
| Issue number | 1 |
| State | Published - Jan 2011 |
Keywords
- Cluster computing
- Dezert-Smaradache Thoery(DSmT)
- Mass function