Paper
1 March 1992 Exponential growth rate of Dempster-Shafer belief functions
Shijie Wang, Marco Valtorta
Author Affiliations +
Abstract
In this paper we discuss some topics of knowledge representation for reasoning under uncertainty in belief network-based systems. In particular, we will examine the seemly obvious but unduly overlooked phenomenon that belief functions can grow at an exponential rate when using Dempster's rule of combination, which often results in belief computations being done in nearly worst cases. This problem has severe practical consequences for the development of belief network-based systems in applications domains where the knowledge structure determines a dense belief network with high degrees of node linkage and especially with large clusterings of belief functions. Empirical evidence suggests that belief networks for some types of problem domain like classification tend to be very dense. Despite the development of efficient local computation schemes for belief propagation in general Dempster-Shafer belief networks, it can be concluded that the actual applicability of belief networks is limited subject to the knowledge structure of the problem domain under consideration.
© (1992) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shijie Wang and Marco Valtorta "Exponential growth rate of Dempster-Shafer belief functions", Proc. SPIE 1707, Applications of Artificial Intelligence X: Knowledge-Based Systems, (1 March 1992); https://doi.org/10.1117/12.56868
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Intelligence systems

Artificial intelligence

Algorithm development

Chemical elements

Decision support systems

Information operations

Carbonates

Back to Top