Idempotent Conjunctive Combination of ...
Document type :
Communication dans un congrès avec actes
Title :
Idempotent Conjunctive Combination of Belief Functions by Distance Minimization
Author(s) :
Klein, John [Auteur]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Destercke, Sébastien [Auteur]
Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques" [Labex MS2T]
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]
Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Destercke, Sébastien [Auteur]
Laboratoire d'Excellence "Maîtrise des Systèmes de Systèmes Technologiques" [Labex MS2T]
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]
Conference title :
4th International Conference on Belief Functions : Theory and Applications (BELIEF 2016)
City :
Pragua
Country :
République tchèque
Start date of the conference :
2016-09-21
Book title :
Lecture Notes in Computer Science
Journal title :
9861
Publisher :
Springer
Publication date :
2016
English keyword(s) :
distance
optimization
belief function
idempotence
conjunctive combination
optimization
belief function
idempotence
conjunctive combination
HAL domain(s) :
Informatique [cs]/Autre [cs.OH]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01396205/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01396205/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01396205/document
- Open access
- Access the document
- art_final.pdf
- Open access
- Access the document
- document
- Open access
- Access the document