TY - JOUR
T1 - Generalizing the Dempster-Shafer Theory to Fuzzy Sets
AU - Yen, John
N1 - Funding Information:
This article is partially based on the author’s Ph.D. thesis at the University of California, Berkeley, which was supported by National Science Foundation Grant DCR-8513139. Part of the research described in the paper was done at USC/Information Sciences Institute and was supported by the Defense Advanced Research Projects Agency under Contract No. MDA903-86-C-0178.
PY - 1990
Y1 - 1990
N2 - With the desire to manage imprecise and vague information in evidential reasoning, several attempts have been made to generalize the Dempster-Shafer (D-S) theory to deal with fuzzy sets. However, the important principle of the D-S theory, that the belief and plausibility functions are treated as lower and upper probabilities, is no longer preserved in these generalizations. A generalization of the D-S theory in which this principle is maintained is described. It is shown that computing the degree of belief in a hypothesis in the D-S theory can be formulated as an optimization problem. The extended belief function is thus obtained by generalizing the objective function and the constraints of the optimization problem. To combine bodies of evidence that may contain vague information, Dempster’s rule is extended by 1) combining generalized compatibility relations based on the possibility theory, and 2) normalizing combination results to account for partially conflicting evidence. Our generalization not only extends the application of the D-S theory but also illustrates a way that probability theory and fuzzy set theory can be integrated in a sound manner in order to deal with different kinds of uncertain information in intelligent systems.
AB - With the desire to manage imprecise and vague information in evidential reasoning, several attempts have been made to generalize the Dempster-Shafer (D-S) theory to deal with fuzzy sets. However, the important principle of the D-S theory, that the belief and plausibility functions are treated as lower and upper probabilities, is no longer preserved in these generalizations. A generalization of the D-S theory in which this principle is maintained is described. It is shown that computing the degree of belief in a hypothesis in the D-S theory can be formulated as an optimization problem. The extended belief function is thus obtained by generalizing the objective function and the constraints of the optimization problem. To combine bodies of evidence that may contain vague information, Dempster’s rule is extended by 1) combining generalized compatibility relations based on the possibility theory, and 2) normalizing combination results to account for partially conflicting evidence. Our generalization not only extends the application of the D-S theory but also illustrates a way that probability theory and fuzzy set theory can be integrated in a sound manner in order to deal with different kinds of uncertain information in intelligent systems.
UR - http://www.scopus.com/inward/record.url?scp=0025434842&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0025434842&partnerID=8YFLogxK
U2 - 10.1109/21.57269
DO - 10.1109/21.57269
M3 - Article
AN - SCOPUS:0025434842
SN - 0018-9472
VL - 20
SP - 559
EP - 570
JO - IEEE Transactions on Systems, Man and Cybernetics
JF - IEEE Transactions on Systems, Man and Cybernetics
IS - 3
ER -