An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion

  title={An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion},
  author={Florentin Smarandache and Jean Dezert},
In this paper one proposes a simple algorithm of combining the fusion rules, those rules which first use the conjunctive rule and then the transfer of conflicting mass to the non-empty sets, in such a way that they gain the property of associativity and fulfill the Markovian requirement for dynamic fusion. Also, a new fusion rule, SDL-improved, is presented. 
3 Citations

Topics from this paper

Advances and Applications of DSmT for Information Fusion
This book is devoted to an emerging branch of Information Fusion based on new approach for modelling the fusion problematic when the information provided by the sources is both uncertain and (highly)
Efficient Processing of Uncertain Data Using Dezert-Smarandache Theory: A Case Study
  • Hossein Jafari, Xiangfang Li, L. Qian
  • Computer Science
    2016 IEEE 14th Intl Conf on Dependable, Autonomic and Secure Computing, 14th Intl Conf on Pervasive Intelligence and Computing, 2nd Intl Conf on Big Data Intelligence and Computing and Cyber Science and Technology Congress(DASC/PiCom/DataCom/CyberSciTech)
  • 2016
This paper proposes a DSm hybrid model with reduced number of classes and thus low computational cost to analyze temperature and humidity data received from multiple sensors to determine comfort zones in a smart building.
Multi-Sensor Life Detection Synergy Platform Design
Life detection based on a single type of information sources detection technology cannot completely meet the needs of the earthquake relief. The existing life detection techniques are include of


Associativity in combination of belief functions; a derivation of minC combination
  • M. Daniel
  • Computer Science, Mathematics
    Soft Comput.
  • 2003
A new approach to understanding contradictions is employed and an original notion of potential contradiction is introduced: an associative combination of generalized belief functions – minC combination and its derivation – is presented as part of the new approach.
Abstract We show how Shafer's concepts of plausibility and belief can be derived as a special case of the compatibility of a linguistically quantified statement with a data base consisting of an
A mathematical theory of evidence
This book develops an alternative to the additive set functions and the rule of conditioning of the Bayesian theory: set functions that need only be what Choquet called "monotone of order of infinity." and Dempster's rule for combining such set functions.
On the Justification of Dempster's Rule of Combination
  • F. Voorbraak
  • Mathematics, Computer Science
    Artif. Intell.
  • 1991
Abstract In Dempster-Shafer theory it is claimed that the pooling of evidence is reflected by Dempster's rule of combination, provided certain requirements are met. The justification of this claim is
On the Combination of Evidence in Various Mathematical Frameworks
The problem of combining pieces of evidence issued from several sources of information, encountered in expert systems when several production rules conclude on the value of the same variable, but also in robotics when information coming from different sensors is to be aggregated.
A Simple View of the Dempster-Shafer Theory of Evidence and Its Implication for the Rule of Combination
This paper presents a meta-analyses of the determinants of earthquake-triggered landsliding in Chile over a period of 12 months in the period of May 21 to 29, 1986 and the results show clear patterns in the number of landsliding events and their intensity.
Combining belief functions when evidence conflicts
  • C. Murphy
  • Computer Science
    Decis. Support Syst.
  • 2000
To achieve convergence, this research suggests incorporating average belief into the combining rule, which best solves the normalization problems, but it does not offer convergence toward certainty, nor a probabilistic basis.
Interdependence between safety-control policy and multiple-sensor schemes via Dempster-Shafer theory
The Dempster-Shafer (D-S) theory has been gaining popularity in fields where incomplete knowledge is a factor. The author explores the application of the D-S theory in system reliability and safety.
Hedging in the Combination of Evidence
We discuss the dilemma suggested by Zadeh when using Dempster's rule for combining evidence. We suggested a method for handling this problem by tbe inclusion of a hedging element.
ECSC, EEC, EAFC, 213-241
  • 9. Voorbraak, F.
  • 1991