Sciweavers

Share
TSMC
2008

A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory

9 years 7 months ago
A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory
The need to merge multiple sources of uncertain information is an important issue in many application areas, especially when there is potential for contradictions between sources. Possibility theory offers a flexible framework to represent, and reason with, uncertain information, and there is a range of merging operators, such as the conjunctive and disjunctive operators, for combining information. However, with the proposals to date, the context of the information to be merged is largely ignored during the process of selecting which merging operators to use. To address this shortcoming, in this paper, we propose an adaptive merging algorithm which selects largely partially maximal consistent subsets (LPMCSs) of sources, that can be merged through relaxation of the conjunctive operator, by assessing the coherence of the information in each subset. In this way, a fusion process can integrate both conjunctive and disjunctive operators in a more flexible manner and thereby be more context...
Anthony Hunter, Weiru Liu
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TSMC
Authors Anthony Hunter, Weiru Liu
Comments (0)
books