Rejoinder on “Likelihood-based belief function: Justification and some extensions to low-quality data”
Texte intégral
Documents relatifs
Abstract—The Evidential K-Nearest-Neighbor (EK-NN) method provided a global treatment of imperfect knowledge regarding the class membership of training patterns. It has
(a) Strong dominance, maximality, e-admissibility (b) Weak dominance, interval-valued utility Figure 6: Iris data set: partial classification (partial preorder case) with the
For example, in [13, 28] the authors propose to define mass functions on the lattice of interval partitions of a set of objects; they obtain a consensus belief function by a
introduced another variant of ECM, called the Median Evidential c-means (MECM), which is an evidential counterpart to the median c-means and median fuzzy c-means algorithms. MECM can
We have presented an identification strategy based on (i) the representation of measurement information by a consonant belief function whose contour func- tion is identical to
The two main approaches are Dempster’s method, which re- gards the observed variable as a function of the parameter and an auxiliary variable with known probability distribution,
A consonant belief function in the parameter space is constructed from the likelihood function, and combined with the pivotal distribution to yield a predictive belief function
Not only this model can be used when the agent directly gets information from the source but it can also be used when the agent gets second hand information i.e., when the agent is