vix.ing · top · new · best · stats · spec

Infinite classes of counter-examples to the Dempster's rule of combination

2004/04/20 by Jean Dezert, Florentin Smarandache, Dezert, Jean +2
Computer Science · Mathematics · #68T37 #68T40 #94A15 #94A17 #Adversarial Robustness in Machine Learning #FOS: Mathematics #General Mathematics (math.GM) #Logic, Reasoning, and Knowledge #math.GM #msc:68T37 #msc:68T40 #msc:94A15 #msc:94A17

paper · pdf · doi:10.48550/arxiv.math/0404371

13 pages, 8 tables

arxiv created 2004/04/20 · openalex publication_date 2004/04/20 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents several classes of fusion problems which cannot be directly attacked by the classical mathematical theory of evidence, also known as the Dempster-Shafer Theory (DST) either because the Shafer's model for the frame of discernment is impossible to obtain or just because the Dempster's rule of combination fails to provide coherent results (or no result at all). We present and discuss the potentiality of the DSmT combined with its classical (or hybrid) rule of combination to attack these infinite classes of fusion problems.

Citations

Related