Idempotent conjunctive and disjunctive combination of belief functions by distance minimization

Abstract

Idempotence is a desirable property when cautiousness is wanted in an information fusion process, since in this case combining identical information should not lead to the reinforcement of some hypothesis. Idempotent operators also guarantee that identical information items are not counted twice in the fusion process, a very important property in decentralized applications where the information origin cannot always be tracked (ad-hoc wireless networks are typical examples). In the theory of belief functions, a sound way to combine conjunctively multiple information items is to design a combination rule that selects the least informative element among a subset of belief functions more informative than each of the combined ones. In contrast, disjunctive rules can be retrieved by selecting the most informative element among a subset of belief functions less informative than each of the combined ones. One interest of such approaches is that they provide idempotent rules by construction.The notions of less and more informative are often formalized through partial orderings extending usual set-inclusion, yet the only two informative partial orders that provide a straightforward idempotent rule leading to a unique result are those based on the conjunctive and disjunctive weight functions. In this article, we show that other partial orders can achieve a similar goal when the problem is slightly relaxed into a distance optimization one. Building upon previous work, this paper investigates the use of distances compatible with informative partial orders to determine a unique solution to the combination problem. The obtained operators are conjunctive/disjunctive, idempotent and commutative, but lack associativity. They are, however, quasi-associative allowing sequential combinations at no extra complexity. Some experiments demonstrate interesting discrepancies as compared to existing approaches, notably with the aforementioned rules relying on weight functions.

Safety case confidence propagation based on Dempster–Shafer theory

“…To deal with the second issue it is commonly admitted that the combination rule used must be idempotent. Some rules, like the cautious rule (Denoeux, 2008), the cautious-adaptive rule (Kallel and Le Hégarat-Mascle, 2009) or the idempotent conjunctive and disjunctive rules (Klein et al, 2018) have this property…”

An Evidential Framework for Localization of Sensors in Indoor Environments

“…The reliability of a source is classically taken into account by the discounting operation, which transforms the supporting function into a weaker, less informative one [28]. The discounted BBA α m AP k ,t (•) related to AP k having an error rate α k is deduced from the BBA m AP k ,t (•) as follows [29],…”

A generic framework to include belief functions in preference handling and multi-criteria decision

“…Such a combination rule is also consistent with Bayesian approaches [48], where evidence are accumulated and revised according to a product rule, only using a more specific model of uncertainty. Note that this assumption of information items independence can be dropped by adopting so-called cautious or idempotent combination rules [13,19,33].…”