From data properties to evidence

The problem of making decisions among propositions based on both uncertain data items and arguments which are not certain is addressed. The primary knowledge discovery issue addressed is a classification problem: which classification does the available evidence support? The method investigated seeks to exploit information available from conventional database systems, namely, the integrity assertions or data dependency information contained in the database. This information allows ranking arguments in terms of their strengths. As a step in the process of discovering classification knowledge, using a database as a secondary knowledge discovery exercise, latent knowledge pertinent to arguments of relevance to the purpose at hand is explicated. This is called evidence. Information is requested via user prompts from an evidential reasoner. It is fed as evidence to the reasoner. An object-oriented structure for managing evidence is used to model the conclusion space and to reflect the evidence structure. The implementation of the evidence structure and an example of its use are outlined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>