Modifiable Combining Functions
Paul Cohen, Glenn Shafer, Prakash Shenoy
Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.
Keywords: Combining Functions, Combinations of Evidence
PDF Link: /papers/87/p357-cohen.pdf
AUTHOR = "Paul Cohen
and Glenn Shafer and Prakash Shenoy",
TITLE = "Modifiable Combining Functions",
BOOKTITLE = "Uncertainty in Artificial Intelligence 3 Annual Conference on Uncertainty in Artificial Intelligence (UAI-87)",
PUBLISHER = "Elsevier Science",
ADDRESS = "Amsterdam, NL",
YEAR = "1987",
PAGES = "357--373"