Titre :

Idempotent conjunctive and disjunctive combination of belief functions by distance minimization

Auteur(s) :

Klein, John [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Destercke, Sébastien [Auteur]
Heuristique et Diagnostic des Systèmes Complexes [Compiègne] [Heudiasyc]
Colot, Olivier [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]

Titre de la revue :

International Journal of Approximate Reasoning

Pagination :

32-48

Éditeur :

Elsevier

Date de publication :

2018

ISSN :

0888-613X

Mot(s)-clé(s) en anglais :

idempotence
distance
combination
partial order
convex optimization
Belief functions

Discipline(s) HAL :

Physique [physics]/Physique [physics]/Analyse de données, Statistiques et Probabilités [physics.data-an]

Résumé en anglais : [en]

Idempotence is a desirable property when cautiousness is wanted in an information fusion process, since in this case combining identical information should not lead to the reinforcement of some hypothesis. Idempotent ...
Lire la suite >Idempotence is a desirable property when cautiousness is wanted in an information fusion process, since in this case combining identical information should not lead to the reinforcement of some hypothesis. Idempotent operators also guarantee that identical information items are not counted twice in the fusion process, a very important property in decentralized applications where the information origin cannot always be tracked (ad-hoc wireless networks are typical examples). In the theory of belief functions, a sound way to combine conjunctively multiple information items is to design a combination rule that selects the least informative element among a subset of belief functions more informative than each of the combined ones. In contrast, disjunctive rules can be retrieved by selecting the most informative element among a subset of belief functions less informative than each of the combined ones. One interest of such approaches is that they provide idempotent rules by construction. The notions of less and more informative are often formalized through partial orderings extending usual set-inclusion, yet the only two informative partial orders that provide a straightforward idempotent rule leading to a unique result are those based on the conjunctive and disjunctive weight functions. In this article, we show that other partial orders can achieve a similar goal when the problem is slightly relaxed into a distance optimization one. Building upon previous work, this paper investigates the use of distances compatible with informative partial orders to determine a unique solution to the combination problem. The obtained operators are conjunctive/disjunctive, idempotent and commutative, but lack associativity. They are, however, quasi-associative allowing sequential combinations at no extra complexity. Some experiments demonstrate interesting discrepancies as compared to existing approaches, notably with the aforementioned rules relying on weight functions.Lire moins >

Langue :

Anglais

Comité de lecture :

Oui

Audience :

Internationale

Vulgarisation :

Non

Collections :

• Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL