In this paper we prove that a recent Bayesian approximation of belief functions, the relative belief of singletons, meets a number of properties with respect to Dempster’s rule of combination which mirrors those satisfied by the relative plausibility of singletons. In particular, its operator commutes with Dempster’s sum of plausibility functions, while perfectly representing a plausibility function when combined through Dempster’s rule. This suggests a classification of all Bayesian approximations into two families according to the operator they relate to.
Cuzzolin, F
Year of publication: 2008Date of RADAR deposit: 2011-02-09