An Efficient Dempster - Shafer Evidence Combination Scheme for Uncertainty Handling


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 3, No. 4, pp. 908-914, Jul. 1996
10.3745/KIPSTE.1996.3.4.908,   PDF Download:

Abstract

A number of techniques have been studied for handling uncertainty in the development of expert systems. One of technique adopted in many expert systems is the Dempster-Shafer evidence combination scheme. This has been the main focus among others due to its favorable features and computational complexity. In this paper, we develop an algorithm to deal with the exponential complexity inherent in Dempster-Shafer evidence combination. In the evidence combination process, we divide the frame of discernment into two groups, one for those common in both belief functions and the other for the rest. A property is found that in computing new belief function for the latter group, the result of evidence combination show linear change. The irrelevancy factor is derived and used to compute the change. The main idea of the method is to reduce the size of the frame of discernment and thus exponential complexity.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. J. Sung, "An Efficient Dempster - Shafer Evidence Combination Scheme for Uncertainty Handling," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 3, no. 4, pp. 908-914, 1996. DOI: 10.3745/KIPSTE.1996.3.4.908.

[ACM Style]
Lee Jae Sung. 1996. An Efficient Dempster - Shafer Evidence Combination Scheme for Uncertainty Handling. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 3, 4, (1996), 908-914. DOI: 10.3745/KIPSTE.1996.3.4.908.