$\alpha$-junctions of categorical mass functions
Document type :
Communication dans un congrès avec actes
Title :
$\alpha$-junctions of categorical mass functions
Author(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
Scientific editor(s) :
F. Cuzzolin
Conference title :
third international conference on belief functions
City :
Oxford
Country :
Royaume-Uni
Start date of the conference :
2014-09-26
Journal title :
Lecture Notes in Artificial Intelligence
Publisher :
Springer
Publication date :
2014-06-25
English keyword(s) :
belief functions
alpha-junctions
alpha-junctions
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01012048v2/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01012048v2/document
- Open access
- Access the document
- document
- Open access
- Access the document
- art_icbf2014_HAL.pdf
- Open access
- Access the document