Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings         Authors   Author's Info   Article details         Search    
An Efficient Implementation of Belief Function Propagation
Hong Xu
Abstract:
The local computation technique (Shafer et al. 1987, Shafer and Shenoy 1988, Shenoy and Shafer 1986) is used for propagating belief functions in so called a Markov Tree. In this paper, we describe an efficient implementation of belief function propagation on the basis of the local computation technique. The presented method avoids all the redundant computations in the propagation process, and so makes the computational complexity decrease with respect to other existing implementations (Hsia and Shenoy 1989, Zarley et al. 1988). We also give a combined algorithm for both propagation and re-propagation which makes the re-propagation process more efficient when one or more of the prior belief functions is changed.
Keywords:
Pages: 425-432
PS Link:
PDF Link: /papers/91/p425-xu.pdf
BibTex:
@INPROCEEDINGS{Xu91,
AUTHOR = "Hong Xu ",
TITLE = "An Efficient Implementation of Belief Function Propagation",
BOOKTITLE = "Proceedings of the Seventh Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-91)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Mateo, CA",
YEAR = "1991",
PAGES = "425--432"
}


hosted by DSL   •   site info   •   help