AN ALGORITHMIC APPROACH TO COMBINING BELIEF FUNCTIONS

Authors
Citation
Be. Tonn, AN ALGORITHMIC APPROACH TO COMBINING BELIEF FUNCTIONS, International journal of intelligent systems, 11(7), 1996, pp. 463-476
Citations number
20
Categorie Soggetti
System Science","Controlo Theory & Cybernetics","Computer Sciences, Special Topics","Computer Science Artificial Intelligence
ISSN journal
08848173
Volume
11
Issue
7
Year of publication
1996
Pages
463 - 476
Database
ISI
SICI code
0884-8173(1996)11:7<463:AAATCB>2.0.ZU;2-W
Abstract
Methods of combination are used to synthesize pieces of evidence of eq ual standing that represent different aspects of a specific system abo ut which a diagnosis is to be made. Combination is distinct from conse nsus, when complete diagnoses rendered by different knowledge sources require synthesis, and conditionalization, where pieces of evidence to be synthesized have dissymmetric relationships to each other. The Dem pster-Shafer Rule is the quintessential combination method. However, i t has been criticized for its inability to handle inconsistent pieces of evidence and for the way it focuses the weight of evidence. This ar ticle presents an alternative combination method that is capable of ha ndling inconsistent evidence and relates evidence focusing to the amou nt of information resident in pieces of evidence. The method is capabl e of combining belief functions. Future research should address extend ing the method to the combination of a broad class of imprecise probab ility functions. (C) 1996 John Wiley & Sons, Inc.