On computing evidential centroid through conjunctive combination: an impossibility theorem

Yiru Zhang (1, 2, 3) , Sébastien Destercke (4) , Zuowei Zhang (5) , Tassadit Bouadi (6) , Arnaud Martin (5)

1 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes
2 CY - CY Cergy Paris Université
3 MIDI - Multimedia Indexation and Data Integration
4 Heudiasyc - Heuristique et Diagnostic des Systèmes Complexes [Compiègne]
5 DRUID - Declarative & Reliable management of Uncertain, user-generated Interlinked Data
6 LACODAM - Large Scale Collaborative Data Mining

The theory of belief functions (TBF) is now a widespread framework to deal and reason with uncertain and imprecise information, in particular to solve information fusion and clustering problems. Combination functions (rules) and distances are essential tools common to both the clustering and information fusion problems in the context of TBF, which have generated considerable literature. Distances and combination between evidence corpus of TBF are indeed often used within various clustering and classification algorithms, however their interplay and connections have seldom been investigated, which is the topic of this paper. More precisely, we focus on the problem of aggregating evidence corpus to obtain a representative one, and we show through an impossibility theorem that in this case, there is a fundamental contradiction between the use of conjunctive combination rules on the one hand, and the use of distances on the other hand. Rather than adding new methodologies, such results are instrumental in guiding the user among the many methodologies that already exist. To illustrate the interest of our results, we discuss different cases where they are at play. Impact Statement-Within the theory of belief functions, both distances and conjunctive combination rules can be used to achieve very similar purposes: evaluating the conflict between sources, performing supervised or unsupervised learning in presence of evidential information, or more simply obtaining a synthetic representation of multiple items of information. However, the results obtained by both approaches may show some inconsistency between them. This paper provides some insight as to why this may happen, showing that the two approaches are definitely at odds, and that using distances is, for instance, incompatible with some fundamental notions of the theory of belief functions, such as the least commitment principle. We illustrate the importance of the studied differences on problems such as k-centroid clustering, and discuss the importance of interpretations in such problems, which is rarely done in the literature.

Mots clés: Theory of belief functions; combination rules; metric; uncertainty reasoning; k-centroid clustering

Domaines: Intelligence artificielle [cs.AI]; Système multi-agents [cs.MA]; Réseaux sociaux et d'information [cs.SI]

Yiru Zhang, Sébastien Destercke, Zuowei Zhang, Tassadit Bouadi, Arnaud Martin. On computing evidential centroid through conjunctive combination: an impossibility theorem. IEEE Transactions on Artificial Intelligence, 2022, pp.1-10. ⟨10.1109/TAI.2022.3180973⟩. ⟨hal-03698839⟩