Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
A Monte-Carlo Algorithm for Dempster-Shafer Belief
Nic Wilson
Abstract:
A very computationally-efficient Monte-Carlo algorithm for the calculation of Dempster-Shafer belief is described. If Bel is the combination using Dempster's Rule of belief functions Bel, ..., Bel,7, then, for subset b of the frame C), Bel(b) can be calculated in time linear in 1(31 and m (given that the weight of conflict is bounded). The algorithm can also be used to improve the complexity of the Shenoy-Shafer algorithms on Markov trees, and be generalised to calculate Dempster-Shafer Belief over other logics.
Keywords:
Pages: 414-417
PS Link:
PDF Link: /papers/91/p414-wilson.pdf
BibTex:
@INPROCEEDINGS{Wilson91,
AUTHOR = "Nic Wilson ",
TITLE = "A Monte-Carlo Algorithm for Dempster-Shafer Belief",
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 = "414--417"
}


hosted by DSL   •   site info   •   help