An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion
<|reference_start|>An Algorithm for Quasi-Associative and Quasi-Markovian Rules of Combination in Information Fusion: 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.<|reference_end|>
@article{smarandache2004an,
    title={An Algorithm for Quasi-Associative and Quasi-Markovian Rules of
  Combination in Information Fusion},
    author={Florentin Smarandache, Jean Dezert},
    journal={International Journal of Applied Mathematics & Statistics, Vol.
  22, No. S11 (Special Issue on Soft Computing), 33-42, 2011},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0408021},
    primaryClass={cs.AI}
}