arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.2383cs.AI
收藏

Dempster-Shafer理论在模糊集上的推广

Generalizing the Dempster-Shafer Theory to Fuzzy Sets

John Yen

摘要:

由于希望将Dempster-Shafer理论应用于证据强度通常不精确和模糊的复杂现实世界问题,已经进行了几次尝试来推广该理论。然而,D-S理论中的重要概念,即置信度函数和可信度函数是上概率和下概率,在这些推广中不再保留。在本文中,我们描述了一个广义的证据理论,在模糊集的置信度是通过最小化的模糊集的概率由一个基本的概率分配的约束下获得的。要制定一个模糊焦点元素的概率约束,我们将其分解成一组辅音非模糊焦点元素。通过将相容关系推广到可能性理论,我们能够证明我们推广到基于可能性分布的Dempster规则。我们的推广不仅扩展了D-S理论的应用,而且说明了一种方法,概率论和模糊集理论可以结合起来,以处理人工智能系统中的各种不确定性信息。

英文摘要:

With the desire to apply the Dempster-Shafer theory to complex real world problems where the evidential strength is often imprecise and vague, several attempts have been made to generalize the theory. However, the important concept in the D-S theory that the belief and plausibility functions are lower and upper probabilities is no longer preserved in these generalizations. In this paper, we describe a generalized theory of evidence where the degree of belief in a fuzzy set is obtained by minimizing the probability of the fuzzy set under the constraints imposed by a basic probability assignment. To formulate the probabilistic constraint of a fuzzy focal element, we decompose it into a set of consonant non-fuzzy focal elements. By generalizing the compatibility relation to a possibility theory, we are able to justify our generalization to Dempster's rule based on possibility distribution. 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 combined to deal with different kinds of uncertain information in AI systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑