Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userImportance of Sources using the Repeated Fusion Method and the Proportional Conflict Redistribution Rules #5 and #6
78
0
0.0
(
0
)
Added by
Jean Dezert
Publication date
2010
fields
Informatics Engineering
and research's language is
English
Authors
Florentin Smarandache
Ask ChatGPT about the research
No Arabic abstract
We present in this paper some examples of how to compute by hand the PCR5 fusion rule for three sources, so the reader will better understand its mechanism. We also take into consideration the importance of sources, which is different from the classical discounting of sources.
rate research
Read More
In this chapter, we present and discuss a new generalized proportional conflict redistribution rule. The Dezert-Smarandache extension of the Demster-Shafer theory has relaunched the studies on the combination rules especially for the management of the conflict. Many combination rules have been proposed in the last few years. We study here different combination rules and compare them in terms of decision on didactic example and on generated data. Indeed, in real applications, we need a reliable decision and it is the final results that matter. This chapter shows that a fine proportional conflict redistribution rule must be preferred for the combination in the belief function theory.
In this chapter, we present two applications in information fusion in order to evaluate the generalized proportional conflict redistribution rule presented in the chapter cite{Martin06a}. Most of the time the combination rules are evaluated only on simple examples. We study here different combination rules and compare them in terms of decision on real data. Indeed, in real applications, we need a reliable decision and it is the final results that matter. Two applications are presented here: a fusion of human experts opinions on the kind of underwater sediments depict on sonar image and a classifier fusion for radar targets recognition.
We address the question whether the condition on a fusion category being solvable or not is determined by its fusion rules. We prove that the answer is affirmative for some families of non-solvable examples arising from representations of semisimple Hopf algebras associated to exact factorizations of the symmetric and alternating groups. In the context of spherical fusion categories, we also consider the invariant provided by the $S$-matrix of the Drinfeld center and show that this invariant does determine the solvability of a fusion category provided it is group-theoretical.
The Demazure character formula is applied to the Verlinde formula for affine fusion rules. We follow Littelmanns derivation of a generalized Littlewood-Richardson rule from Demazure characters. A combinatorial rule for affine fusions does not result, however. Only a modified version of the Littlewood-Richardson rule is obtained that computes an (old) upper bound on the fusion coefficients of affine $A_r$ algebras. We argue that this is because the characters of simple Lie algebras appear in this treatment, instead of the corresponding affine characters. The Bruhat order on the affine Weyl group must be implicated in any combinatorial rule for affine fusions; the Bruhat order on subgroups of this group (such as the finite Weyl group) does not suffice.
Nansons and Baldwins voting rules select a winner by successively eliminating candidates with low Borda scores. We show that these rules have a number of desirable computational properties. In particular, with unweighted votes, it is NP-hard to manipulate either rule with one manipulator, whilst with weighted votes, it is NP-hard to manipulate either rule with a small number of candidates and a coalition of manipulators. As only a couple of other voting rules are known to be NP-hard to manipulate with a single manipulator, Nansons and Baldwins rules appear to be particularly resistant to manipulation from a theoretical perspective. We also propose a number of approximation methods for manipulating these two rules. Experiments demonstrate that both rules are often difficult to manipulate in practice. These results suggest that elimination style voting rules deserve further study.
suggested questions
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
