A Monte-Carlo Algorithm for Dempster-Shafer Belief

📝 Original Info

• Title: A Monte-Carlo Algorithm for Dempster-Shafer Belief
• ArXiv ID: 1303.5757
• Date: 2013-03-26
• Authors: Researchers from original ArXiv paper

📝 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.

💡 Deep Analysis

Deep Dive into A Monte-Carlo Algorithm for Dempster-Shafer Belief.

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.

📄 Full Content

Reference