Modifiable Combining Functions

03/27/2013
by   Paul Cohen, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 6

page 8

page 9

research
03/27/2013

Deriving And Combining Continuous Possibility Functions in the Framework of Evidential Reasoning

To develop an approach to utilizing continuous statistical information w...
research
12/07/2017

Enabling the Remote Acquisition of Digital Forensic Evidence through Secure Data Transmission and Verification

Providing the ability to any law enforcement officer to remotely transfe...
research
06/30/2011

A New Technique for Combining Multiple Classifiers using The Dempster-Shafer Theory of Evidence

This paper presents a new classifier combination technique based on the ...
research
04/17/2014

Generalized Evidence Theory

Conflict management is still an open issue in the application of Dempste...
research
02/07/2022

Combining Evidence

The problem of combining the evidence concerning an unknown, contained i...
research
03/13/2013

Representing Heuristic Knowledge in D-S Theory

The Dempster-Shafer theory of evidence has been used intensively to deal...
research
11/12/2012

Hybrid Systems for Knowledge Representation in Artificial Intelligence

There are few knowledge representation (KR) techniques available for eff...

Please sign up or login with your details

Forgot password? Click here to reset