Skip to Main content Skip to Navigation

Fonctions de croyance : décompositions canoniques et règles de combinaison.

Abstract : In comparison to possibility theory, the Transferable Belief Model (TBM) - a nonprobabilistic interpretation of Dempster-Shafer theory - enjoys little choice in terms of aggregation operators for the fusion of information. In this thesis, the problem of introducing some flexibility for the combination of belief functions - the mathematical tool allowing the representation of information in the TBM - is tackled. Our first contribution is to introduce infinite families of conjunctive and disjunctive combination rules for belief functions, mimicking thus the situation in possibility theory for what concerns conjunctive and disjunctive operators. Our second contribution is a set of results making an infinite family of combination rules, introduced initially in a pure formal manner and called the alpha-junctions, of practical interest. First, we show that these rules correspond to a particular form of knowledge about the truthfulness of the sources of information. Second, we provide several new simple means for the computation of the combination by an alpha-junction.
Complete list of metadatas
Contributor : Frédéric Pichon <>
Submitted on : Saturday, February 23, 2013 - 6:27:48 PM
Last modification on : Wednesday, November 18, 2020 - 8:48:02 AM
Long-term archiving on: : Friday, May 24, 2013 - 3:25:09 AM


  • HAL Id : tel-00793859, version 1



Frédéric Pichon. Fonctions de croyance : décompositions canoniques et règles de combinaison.. Traitement du signal et de l'image [eess.SP]. Université de Technologie de Compiègne, 2009. Français. ⟨tel-00793859⟩



Record views


Files downloads