On Computing Evidential Centroid Through Conjunctive Combination: An Impossibility Theorem

The theory of belief functions (TBFs) is now a widespread framework to deal and reason with uncertain imprecise information, in particular solve information fusion clustering problems. Combination (rules) distances are essential tools common both the problems context TBF, which have generated considerable literature. Distances combination between evidence corpus TBF indeed often used within various classification algorithms, however, their interplay connections seldom been investigated, topic this article. More precisely, we focus on problem aggregating obtain representative one, show through an impossibility theorem that case, there fundamental contradiction use conjunctive rules one hand, other hand. Rather than adding new methodologies, such results instrumental guiding user among many methodologies already exist. To illustrate interest our results, discuss different cases where they at play.