A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Alternative approaches to the widely known pignistic transformation of belief functions are presented and analyzed. A series of various probabilistic transformations is examined namely from the point of view of their consistency with rules for belief function combination and their consistency with probabilistic upper and lower bounds. A new definition of general probabilistic transformation is introduced and a discussion of their applicability is included.doi:10.1007/11518655_46 fatcat:gavbyf6frbhxlbwkdbn2kwghsm