Abstract
Part 2 of this article is devoted to the analysis of a new class of combination rules on belief functions generated by conditioning w.r.t. random sets and their linear convex combinations. Each such rule obeys two requirements: the consensus requirement with the conjunction rule means that this rule coincides with Dempster's rule on non-conflicting sources of information, and the consensus requirement with a mixture rule means that the result must be a specialization of their mixture combination. We show that this new class of combination rules is closed under convex combinations of such rules and their compositions. This allows us to implement the conflict management using the introduced functionals for measuring the specialization relation on belief functions. We also introduce similar rules for idempotent combination rules on credal sets obeying the similar consensus requirements and study the results obtained using various examples.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
