Consonant approximations of belief functions (Q751637): Difference between revisions

Based on a recently introduced definition of inclusion between random sets, a general notion of approximation of a belief function by some other set-function is introduced. Viewing a fuzzy set as a consonant random set, it is shown how to construct fuzzy sets that may act as approximations of belief functions. Two kinds of approximations are considered: inner approximations that provide upper (resp. lower) bounds on belief degrees (resp. plausibility degrees) and outer approximations that provide lower (resp. upper) bounds on belief degrees (resp. plausibility degrees). Minimal (resp. maximal) outer (resp. inner) consonant approximations are characterized in a constructive way. The particular problem of approximating a probability measure by a fuzzy set is solved. Applications to the approximate computation of belief functions on Cartesian products, combinations by Dempster rule, and functions of random-set-valued arguments by means of fuzzy set operations are sketched.