$\alpha$-junctions of categorical mass functions
Type de document :
Communication dans un congrès avec actes
Titre :
$\alpha$-junctions of categorical mass functions
Auteur(s) :
Klein, John [Auteur]
LAGIS-SI
Loudahi, Mehena [Auteur]
LAGIS-SI
Vannobel, Jean-Marc [Auteur]
LAGIS-SI
Colot, Olivier [Auteur]
LAGIS-SI
LAGIS-SI
Loudahi, Mehena [Auteur]
LAGIS-SI
Vannobel, Jean-Marc [Auteur]
LAGIS-SI
Colot, Olivier [Auteur]
LAGIS-SI
Éditeur(s) ou directeur(s) scientifique(s) :
F. Cuzzolin
Titre de la manifestation scientifique :
third international conference on belief functions
Ville :
Oxford
Pays :
Royaume-Uni
Date de début de la manifestation scientifique :
2014-09-26
Titre de la revue :
Lecture Notes in Artificial Intelligence
Éditeur :
Springer
Date de publication :
2014-06-25
Mot(s)-clé(s) en anglais :
belief functions
alpha-junctions
alpha-junctions
Discipline(s) HAL :
Informatique [cs]/Intelligence artificielle [cs.AI]
Résumé en anglais : [en]
The set of $\alpha$-junctions is the set of linear associative and commutative combination operators for belief functions. Consequently, the properties of $\alpha$-junctive rules make them particularly attractive on a ...
Lire la suite >The set of $\alpha$-junctions is the set of linear associative and commutative combination operators for belief functions. Consequently, the properties of $\alpha$-junctive rules make them particularly attractive on a theoretic point of view. However, they are rarely used in practice except for the $\alpha=1$ case which corresponds to the widely used and well understood conjunctive and disjunctive rules. The lack of success of $\alpha$-junctions when $\alpha<1$ is mainly explained by two reasons. First, they require a greater computation load due to a more complex mathematical definition. Second, the mass function obtained after combination is hard to interpret and sometimes counter-intuitive. Pichon and Den\oe ux [4] brought a significant contribution to circumvent both of these two limitations. In this article, it is intended to pursue these efforts toward a better understanding of $\alpha$-junctions. To that end, this study is focused on the behavior of $\alpha$-junctions when categorical mass functions are used as entries of an $\alpha$-junctive combination rule. It is shown that there exists a conjunctive and a disjunctive canonical decomposition of the mass function obtained after combination.Lire moins >
Lire la suite >The set of $\alpha$-junctions is the set of linear associative and commutative combination operators for belief functions. Consequently, the properties of $\alpha$-junctive rules make them particularly attractive on a theoretic point of view. However, they are rarely used in practice except for the $\alpha=1$ case which corresponds to the widely used and well understood conjunctive and disjunctive rules. The lack of success of $\alpha$-junctions when $\alpha<1$ is mainly explained by two reasons. First, they require a greater computation load due to a more complex mathematical definition. Second, the mass function obtained after combination is hard to interpret and sometimes counter-intuitive. Pichon and Den\oe ux [4] brought a significant contribution to circumvent both of these two limitations. In this article, it is intended to pursue these efforts toward a better understanding of $\alpha$-junctions. To that end, this study is focused on the behavior of $\alpha$-junctions when categorical mass functions are used as entries of an $\alpha$-junctive combination rule. It is shown that there exists a conjunctive and a disjunctive canonical decomposition of the mass function obtained after combination.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01012048v2/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01012048v2/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- art_icbf2014_HAL.pdf
- Accès libre
- Accéder au document