Idempotent Conjunctive Combination of ...
Type de document :
Communication dans un congrès avec actes
Titre :
Idempotent Conjunctive 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]
Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques" [Labex MS2T]
Colot, Olivier [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
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]
Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques" [Labex MS2T]
Colot, Olivier [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Titre de la manifestation scientifique :
4th International Conference on Belief Functions : Theory and Applications (BELIEF 2016)
Ville :
Pragua
Pays :
République tchèque
Date de début de la manifestation scientifique :
2016-09-21
Titre de l’ouvrage :
Lecture Notes in Computer Science
Titre de la revue :
9861
Éditeur :
Springer
Date de publication :
2016
Mot(s)-clé(s) en anglais :
distance
optimization
belief function
idempotence
conjunctive combination
optimization
belief function
idempotence
conjunctive combination
Discipline(s) HAL :
Informatique [cs]/Autre [cs.OH]
Résumé en anglais : [en]
When combining multiple belief functions, designing a combination rule that selects the least informative belief function among those more informative than each of the combined ones is a difficult task. Such rules, commonly ...
Lire la suite >When combining multiple belief functions, designing a combination rule that selects the least informative belief function among those more informative than each of the combined ones is a difficult task. Such rules, commonly depicted as " cautious " , are typically required to be idempotent, since when one is cautious, combining identical information should not lead to the reinforcement of some hypothesis. However, applying the least commitment principle using partial orders is in general not straightforward, mainly due to the non-uniqueness of solutions. Building upon previous work, this paper investigates the use of distances compatible with such partial orders to determine a unique solution to the combination problem. The obtained operators are conjunctive, idempo-tent and commutative, but lack associativity. They are, however, quasi-associative allowing sequential combinations at no extra complexity.Lire moins >
Lire la suite >When combining multiple belief functions, designing a combination rule that selects the least informative belief function among those more informative than each of the combined ones is a difficult task. Such rules, commonly depicted as " cautious " , are typically required to be idempotent, since when one is cautious, combining identical information should not lead to the reinforcement of some hypothesis. However, applying the least commitment principle using partial orders is in general not straightforward, mainly due to the non-uniqueness of solutions. Building upon previous work, this paper investigates the use of distances compatible with such partial orders to determine a unique solution to the combination problem. The obtained operators are conjunctive, idempo-tent and commutative, but lack associativity. They are, however, quasi-associative allowing sequential combinations at no extra complexity.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-01396205/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-01396205/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-01396205/document
- Accès libre
- Accéder au document
- art_final.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document