Analyzing the combination of conflicting belief functions
Information Fusion
International Journal of Approximate Reasoning
International Journal of Approximate Reasoning
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
MDAI '09 Proceedings of the 6th International Conference on Modeling Decisions for Artificial Intelligence
In Memoriam: Philippe Smets (1938--2005)
Fuzzy Sets and Systems
Belief functions on real numbers
International Journal of Approximate Reasoning
In memoriam: Philippe Smets (1938-2005)
International Journal of Approximate Reasoning
Semigroup structure of singleton Dempster-Shafer evidence accumulation
IEEE Transactions on Information Theory
International Journal of Approximate Reasoning
Bio-inspired architecture for active sensorimotor localization
SC'10 Proceedings of the 7th international conference on Spatial cognition
Particle filtering in the Dempster--Shafer theory
International Journal of Approximate Reasoning
EDTs: evidential decision trees
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Partially supervised learning by a credal EM approach
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Information Sciences: an International Journal
Hi-index | 0.06 |
This paper explains how multisensor data fusion and target identification can be performed within the transferable belief model (TBM), a model for the representation of quantified uncertainty based on belief functions. We present the underlying theory, in particular the general Bayesian theorem needed to transform likelihoods into beliefs and the pignistic transformation needed to build the probability measure required for decision making. We present how this method applies in practice. We compare its solution with the classical one, illustrating it with an embarrassing example, where the TBM and the probability solutions completely disagree. Computational efficiency of the belief-function solution was supposedly proved in a study that we reproduce and we show that in fact the opposite conclusions hold. The results presented here can be extended directly to many problems of data fusion and diagnosis.