In this paper we discuss the problem of approximating a belief function (b.f.) with a necessity measure or "consonant belief function" (co.b.f.) from a geometric point of view. We focus in particular on outer consonant approximations, i.e. co.b.f.s less committed than the original b.f. in terms of degrees of belief. We show that for each maximal chain of focal elements the set of outer consonant approximation is a polytope. We describe the vertices of such polytope, and characterize the geometry of maximal outer approximations. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Cuzzolin, F. (2009). Complexes of outer consonant approximations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5590 LNAI, pp. 275–286). https://doi.org/10.1007/978-3-642-02906-6_25
Mendeley helps you to discover research relevant for your work.