Uncertainty
Representativeness and Uncertainty in Classification Schemes
Cohen, Paul R., Davis, Alvah, Day, David, Greenberg, Michael, Kjeldsen, Rick, Lander, Susan, Loiselle, Cynthia
The choice of implication as a representation for empirical associations and for deduction as a model of inference requires a mechanism extraneous to deduction to manage uncertainty associated with inference. Consequently, the interpretation of representations of uncertainty is unclear. Representativeness, or degree of fit, is proposed as an interpretation of degree of belief for classification tasks. The calculation of representativeness depends on the nature of the associations between evidence and conclusions. Patterns of associations are characterized as endorsements of conclusions. We discuss an expert system that uses endorsements to control the search for the most representative conclusion, given evidence.
In defense of probability
In Defense of Probability Peter Cheeseman SRI International 333 Ravenswood Ave., Menlo Park, California 94025 Abstract In this paper, it is argued that probability theory, when used correctly, is suffrcient for the task of reasoning under uncertainty. Since numerous authors have rejected probability as inadequate for various reasons, the bulk of the paper is aimed at refuting these claims and indicating the scources of error. In particular, the definition of probability as a measure of belief rather than a frequency ratio is advocated, since a frequency interpretation of probability drastically restricts the domain of applicability. Other sources of error include the confusion between relative and absolute probability, the distinction between probability and the uncertainty of that probability. Also, the interaction of logic and probability is discusses and it is argued that many extensions of logic, such as "default logic" are better understood in a probabilistic framework. The main claim of this paper is that the numerous schemes for representing and reasoning about uncertainty that have appeared in the AI literature are unnecessary--probability is all that is needed. 1 Introduction A glance through any major AI publication shows that an overwhelming proportion of papers are concerned with what might be described as the logical approach to inference and knowledge representation. It now widely accepted that many knowledge representations can be mapped into (first order) predicate calculus, and the corresponding inference procedures can be reduced to a type of controlled logical deduction. However, examples of human reasoning (judgements) are full of such terms as "probably", "most", "usually" etc., showing that many patterns of human reasoning are not logical in form, but intrinsically probabilistic. The claim that many patterns of human reasoning are probabilistic does not mean that the underlying "logic" of such patterns cannot be axiomatized. On the contrary, a basis for such an axiomatization is given in section 3. The claim is that when such an exercise is performed, the resulting patterns of inference are different in form from those found in analogous logical deductions.
Review of A Mathematical Theory of Evidence
It may be argued that this, in principle, is a more realistic approach because it addresses, rather than finesses, the problem of incomplete information in the knowledge base. On the other hand, the Dempster-Shafer theory provides a basis-at least at present-for only a small subset of the rules of combination which are needed for inferencing in expert systems. In particular, the theory does not address the issue of chaining, nor does it come to grips with the fuzziness of probabilities and certainty factors. Thus, although the theory is certainly a step in the right direction, for it provides a framework for dealing with granular data, it does require a great deal of further development to become a broadly useful tool for the management of uncertainty in expert systems. Although not easy to understand, Shafer's book contains a wealth of significant results, and is a must for anyone who wants to do serious research on problems relating to the rules of combination of evidence in expert systems. Indeed, there is no doubt that, in the years to come, the Dempster-Shafer theory and its extensions will become an integral part of the theory of such systems and will certainly occupy an important place in knowledge engineering and related fields.
Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project
Buchanan, Bruce G., Shortliffe, Edward H.
Artificial intelligence, or AI, is largely an experimental science—at least as much progress has been made by building and analyzing programs as by examining theoretical questions. MYCIN is one of several well-known programs that embody some intelligence and provide data on the extent to which intelligent behavior can be programmed. As with other AI programs, its development was slow and not always in a forward direction. But we feel we learned some useful lessons in the course of nearly a decade of work on MYCIN and related programs. In this book we share the results of many experiments performed in that time, and we try to paint a coherent picture of the work. The book is intended to be a critical analysis of several pieces of related research, performed by a large number of scientists. We believe that the whole field of AI will benefit from such attempts to take a detailed retrospective look at experiments, for in this way the scientific foundations of the field will gradually be defined. It is for all these reasons that we have prepared this analysis of the MYCIN experiments.
The complete book in a single file.
Methodological Simplicity in Expert System Construction: The Case of Judgments and Reasoned Assumptions
Probabilistic rules and their variants have recently supported several successful applications of expert systems, in spite of the difficulty of committing informants to particular conditional probabilities or ";certainty factors"; and in spite of the experimentally observed insensitivity of system performance to perturbations of the chosen values. Here we survey recent developments concerning reasoned assumptions which offer hope for avoiding the practical elusiveness of probabilistic rules while retaining theoretical power, for basing systems on the information unhesitatingly gained from expert informants, and reconstructing the entailed degrees of belief later.
Methodological Simplicity in Expert System Construction: The Case of Judgments and Reasoned Assumptions
Editors' Note: Many expert systems require some means criticisms of this approach from those steeped in the practical of handling heuristic rules whose conclusions are less than certain issues of constructing large rule-based expert systems. Abstract the expert system draws inferences in solving different problems. Doyle's paper argues that it is difficult for a human expert "certainty factors," and in spite of the experimentally observed insensitivity of system performance to perturbations of the chosen values Recent successes of "expert systems" stem from much Research Projects Agency (DOD), ARPA Order No. 3597, monitored In the following, we explain the modified approach together with its practical and theoretical attractions. The client's income bracket is 50%, can be found (Minsky, 1975; Shortliffe & Buchanan, 1975; and 2. The client carefully studies market trends, Duda, Hart, & Nilsson, 1976; Szolovits, 1978; Szolovits & THEN: 3. There is evidence (0.8) that the investment Pauker, 1978). Reasoned Assumptions (from Davis, 1979) and would use the rule to draw conclusions whose "certainty factors" depend on the observed certainty Although our approach usually approximates that of Bayesian probabilities, accommodates representational systems based on "frames" namely as subjective degrees of belief.
A Theory of Heuristic Reasoning About Uncertainty
Cohen, Paul R., Grinberg, Milton R.
This article describes a theory of reasoning about uncertainly, based on a representation of states of certainly called endorsements. The theory of endorsements is an alternative to numerical methods for reasoning about uncertainly, such as subjective Bayesian methods (Shortliffe and Buchanan, 1975; Duda hart, and Nilsson, 1976) and Shafer-dempster theory (Shafer, 1976). The fundamental concern with numerical representations of certainty is that they hide the reasoning about uncertainty. While numbers are easy to propagate over inferences, what the numbers mean is unclear. The theory of endorsements provide a richer representation of the factors that affect certainty and supports multiple strategies for dealing with uncertainty.