An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
Florentin Smarandache, Jean Dezert

TL;DR
This paper introduces a simple algorithm that enhances the associativity and Markovian properties of fusion rules in information fusion, along with a new SDL-improved rule for better conflict management.
Contribution
It proposes a novel algorithm for combining fusion rules to achieve associativity and Markovian properties, and introduces a new SDL-improved rule.
Findings
Algorithm successfully ensures associativity in fusion rules
Algorithm maintains Markovian property for dynamic fusion
New SDL-improved rule enhances conflict resolution
Abstract
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 rule, SDL-improved, is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
