Hostname: page-component-77f85d65b8-t6st2 Total loading time: 0 Render date: 2026-03-29T01:04:34.361Z Has data issue: false hasContentIssue false

Modifiable combining functions1

Published online by Cambridge University Press:  27 February 2009

Paul R. Cohen
Affiliation:
Computer and Information Science, University of Massachusetts, Amherst, MA 01003 and School of Business, University of Kansas, Lawrence, KA 66045, U.S.A.
Glenn Shafer
Affiliation:
Computer and Information Science, University of Massachusetts, Amherst, MA 01003 and School of Business, University of Kansas, Lawrence, KA 66045, U.S.A.
Prakash P. Shenoy
Affiliation:
Computer and Information Science, University of Massachusetts, Amherst, MA 01003 and School of Business, University of Kansas, Lawrence, KA 66045, U.S.A.

Abstract

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1987

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable