A computationally efficient approximation of Dempster-Shafer theory
International Journal of Man-Machine Studies
The dynamic of belief in the transferable belief model and specialization-generalization matrices
UAI '92 Proceedings of the eighth conference on Uncertainty in Artificial Intelligence
"Not Impossible" vs. "Guaranteed Possible" in Fusion and Revision
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
The canonical decomposition of a weighted belief
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
International Journal of Approximate Reasoning
Hi-index | 0.00 |
Based on the canonical decomposition of belief functions, Smets introduced the concept of a latent belief structure (LBS). This concept is revisited in this article. The study of the combination of LBSs allows us to propose a less committed version of Dempster's rule, resulting in a commutative, associative and idempotent rule of combination for LBSs. This latter property makes it suitable to combine non distinct bodies of evidence. A sound method based on the plausibility transformation is also given to infer decisions from LBSs. In addition, an extension of the new rule is proposed so that it may be used to optimize the combination of imperfect information with respect to the decisions inferred.