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

Anthony Hunter, Weiru Liu

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

The need to merge multiple sources of uncertaininformation is an important issue in many application areas,especially when there is potential for contradictions betweensources. Possibility theory offers a flexible framework to represent,and reason with, uncertain information, and there isa range of merging operators, such as the conjunctive anddisjunctive operators, for combining information. However, withthe proposals to date, the context of the information to be mergedis largely ignored during the process of selecting which mergingoperators to use. To address this shortcoming, in this paper,we propose an adaptive merging algorithm which selects largelypartially maximal consistent subsets (LPMCSs) of sources, thatcan be merged through relaxation of the conjunctive operator, byassessing the coherence of the information in each subset. In thisway, a fusion process can integrate both conjunctive and disjunctiveoperators in a more flexible manner and thereby be morecontext dependent. A comparison with related merging methodsshows how our algorithm can produce a more consensual result.
Original languageEnglish
Pages (from-to)1385-1397
Number of pages13
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part A
Volume38
Issue number6
DOIs
Publication statusPublished - Nov 2008

Fingerprint Dive into the research topics of 'A Context-Dependent Algorithm for Merging Uncertain Information in Possibility Theory'. Together they form a unique fingerprint.

  • Cite this