Reasoning with Uncertainty دكترمحسن كاهاني

Slides:



Advertisements
Similar presentations
FT228/4 Knowledge Based Decision Support Systems
Advertisements

Lahore University of Management Sciences, Lahore, Pakistan Dr. M.M. Awais- Computer Science Department 1 Lecture 12 Dealing With Uncertainty Probabilistic.
Bayesian Network and Influence Diagram A Guide to Construction And Analysis.
CHAPTER 13 Inference Techniques. Reasoning in Artificial Intelligence n Knowledge must be processed (reasoned with) n Computer program accesses knowledge.
 Negnevitsky, Pearson Education, Lecture 3 Uncertainty management in rule- based expert systems n Introduction, or what is uncertainty? n Basic.
Artificial Intelligence Universitatea Politehnica Bucuresti Adina Magda Florea
Rulebase Expert System and Uncertainty. Rule-based ES Rules as a knowledge representation technique Type of rules :- relation, recommendation, directive,
Uncertainty Everyday reasoning and decision making is based on uncertain evidence and inferences. Classical logic only allows conclusions to be strictly.
FT228/4 Knowledge Based Decision Support Systems
Chapter 4 Probability and Probability Distributions
Chapter 4: Reasoning Under Uncertainty
B. Ross Cosc 4f79 1 Uncertainty Knowledge can have uncertainty associated with it - Knowledge base: rule premises, rule conclusions - User input: uncertain,
5/17/20151 Probabilistic Reasoning CIS 479/579 Bruce R. Maxim UM-Dearborn.
Modeling Human Reasoning About Meta-Information Presented By: Scott Langevin Jingsong Wang.
Paula Matuszek CSC 8520, Fall, 2005 Dealing with Uncertainty.
AI – CS364 Uncertainty Management Introduction to Uncertainty Management 21 st September 2006 Dr Bogdan L. Vrusias
Approximate Reasoning 1 Expert Systems Dr. Samy Abu Nasser.
AI – CS364 Uncertainty Management 26 th September 2006 Dr Bogdan L. Vrusias
CSNB234 ARTIFICIAL INTELLIGENCE
© 2002 Franz J. Kurfess Reasoning under Uncertainty 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
1 Chapter 12 Probabilistic Reasoning and Bayesian Belief Networks.
1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
© 2002 Franz J. Kurfess Introduction 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
© Franz J. Kurfess Reasoning under Uncertainty CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
Objectives Explore the sources of uncertainty in rules Analyze some methods for dealing with uncertainty Learn about the Dempster-Shafer theory Learn.
© Franz J. Kurfess Reasoning under Uncertainty 1 CPE/CSC 481: Knowledge-Based Systems Dr. Franz J. Kurfess Computer Science Department Cal Poly.
1 Bayesian Reasoning Chapter 13 CMSC 471 Adapted from slides by Tim Finin and Marie desJardins.
© C. Kemke1Reasoning - Introduction COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
Chapter 5: Inexact Reasoning
Lecture 05 Rule-based Uncertain Reasoning
CS Bayesian Learning1 Bayesian Learning. CS Bayesian Learning2 States, causes, hypotheses. Observations, effect, data. We need to reconcile.
Chapter 9 Flashcards. measurement method that uses uniform procedures to collect, score, interpret, and report numerical results; usually has norms and.
Chapter 4: Reasoning Under Uncertainty
Knowledge-Based Systems Knowledge-Based Systems Dr. Marco Antonio Ramos Corchado Computer Science Department.
Chapter 8 Probability Section R Review. 2 Barnett/Ziegler/Byleen Finite Mathematics 12e Review for Chapter 8 Important Terms, Symbols, Concepts  8.1.
Inexact Reasoning. 2 Objectives Explore the sources of uncertainty in rules Analyze some methods for dealing with uncertainty Learn about the Dempster-Shafer.
© C. Kemke Reasoning under Uncertainty 1 COMP 4200: Expert Systems Dr. Christel Kemke Department of Computer Science University of Manitoba.
Introduction to Probability  Probability is a numerical measure of the likelihood that an event will occur.  Probability values are always assigned on.
1 Reasoning Under Uncertainty Artificial Intelligence Chapter 9.
Uncertainty Uncertain Knowledge Probability Review Bayes’ Theorem Summary.
Uncertainty Management in Rule-based Expert Systems
Uncertainty. Assumptions Inherent in Deductive Logic-based Systems All the assertions we wish to make and use are universally true. Observations of the.
Probability Course web page: vision.cis.udel.edu/cv March 19, 2003  Lecture 15.
Uncertainty in Expert Systems
1 Chapter 12 Probabilistic Reasoning and Bayesian Belief Networks.
Reasoning Under Uncertainty. 2 Objectives Learn the meaning of uncertainty and explore some theories designed to deal with it Find out what types of errors.
International Conference on Fuzzy Systems and Knowledge Discovery, p.p ,July 2011.
Textbook Basics of an Expert System: – “Expert systems: Design and Development,” by: John Durkin, 1994, Chapters 1-4. Uncertainty (Probability, Certainty.
UNIVERSITI TENAGA NASIONAL 1 CCSB354 ARTIFICIAL INTELLIGENCE Chapter 8.2 Certainty Factors Chapter 8.2 Certainty Factors Instructor: Alicia Tang Y. C.
Expert System Seyed Hashem Davarpanah University of Science and Culture.
DEALING WITH UNCERTAINTY (1) WEEK 5 CHAPTER 3. Introduction The world is not a well-defined place. There is uncertainty in the facts we know: – What’s.
Probability Theory. Topics Basic Probability Concepts: Sample Spaces and Events, Simple Probability, and Joint Probability, Conditional Probability Bayes’
Chapter 4: Reasoning Under Uncertainty Expert Systems: Principles and Programming, Fourth Edition Original by Course Technology Modified by Ramin Halavati.
Anifuddin Azis UNCERTAINTY. 2 Introduction The world is not a well-defined place. There is uncertainty in the facts we know: What’s the temperature? Imprecise.
Chapter 12 Certainty Theory (Evidential Reasoning) 1.
REASONING UNDER UNCERTAINTY: CERTAINTY THEORY
CHAPTER 5 Handling Uncertainty BIC 3337 EXPERT SYSTEM.
Review of Probability.
Chapter 3 Probability.
What is Probability? Quantification of uncertainty.
Quick Review Probability Theory
Quick Review Probability Theory
Inexact Reasoning 1 Session 9
REASONING WITH UNCERTANITY
Reasoning Under Uncertainty in Expert System
Basic Probabilistic Reasoning
28th September 2005 Dr Bogdan L. Vrusias
Certainty Factor Model
basic probability and bayes' rule
Presentation transcript:

Reasoning with Uncertainty دكترمحسن كاهاني

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Introduction  reasoning under uncertainty and with inexact knowledge  frequently necessary for real-world problems  heuristics  ways to mimic heuristic knowledge processing  methods used by experts  empirical associations  experiential reasoning  based on limited observations  probabilities  objective (frequency counting)  subjective (human experience )  reproducibility  will observations deliver the same results when repeated

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Dealing with Uncertainty  expressiveness  can concepts used by humans be represented adequately?  can the confidence of experts in their decisions be expressed?  comprehensibility  representation of uncertainty  utilization in reasoning methods  correctness  probabilities  adherence to the formal aspects of probability theory  relevance ranking  probabilities don’t add up to 1, but the “most likely” result is sufficient  long inference chains  tend to result in extreme (0,1) or not very useful (0.5) results  computational complexity  feasibility of calculations for practical purposes

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Sources of Uncertainty  data  data missing, unreliable, ambiguous,  representation imprecise, inconsistent, subjective, derived from defaults, …  expert knowledge  inconsistency between different experts  plausibility  “best guess” of experts  quality  causal knowledge  deep understanding  statistical associations  observations  scope  only current domain, or more general

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Sources of Uncertainty (cont.)  knowledge representation  restricted model of the real system  limited expressiveness of the representation mechanism  inference process  deductive  the derived result is formally correct, but inappropriate  derivation of the result may take very long  inductive  new conclusions are not well-founded  not enough samples  samples are not representative  unsound reasoning methods  induction, non-monotonic, default reasoning

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Uncertainty in Individual Rules  errors  domain errors  representation errors  inappropriate application of the rule  likelihood of evidence  for each premise  for the conclusion  combination of evidence from multiple premises

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Uncertainty and Multiple Rules  conflict resolution  if multiple rules are applicable, which one is selected  explicit priorities, provided by domain experts  implicit priorities derived from rule properties  specificity of patterns, ordering of patterns creation time of rules, most recent usage, …  compatibility  contradictions between rules  subsumption  one rule is a more general version of another one  redundancy  missing rules  data fusion  integration of data from multiple sources

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Uncertainty Management Techniques  Probability Theory  Bayesian Approach  Certainty Factors  Possibility Theory  Fuzzy Logic  Will be covered comprehensively in future

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Basics of Probability Theory  mathematical approach for processing uncertain information  sample space set X = {x 1, x 2, …, x n }  collection of all possible events  can be discrete or continuous  probability number P(x i ) reflects the likelihood of an event x i to occur  non-negative value in [0,1]  total probability of the sample space (sum of probabilities) is 1  for mutually exclusive events, the probability for at least one of them is the sum of their individual probabilities  experimental probability  based on the frequency of events  subjective probability  based on expert assessment

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Compound Probabilities  describes independent events  do not affect each other in any way  joint probability of two independent events A and B P(A  B) = n(A  B) / n(s) = P(A) * P (B) where n(S) is the number of elements in S  union probability of two independent events A and B P(A  B) = P(A) + P(B) - P(A  B) = P(A) + P(B) - P(A) * P (B)

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Conditional Probabilities  describes dependent events  affect each other in some way  conditional probability of event A given that event B has already occurred P(A|B) = P(A  B) / P(B)

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Advantages and Problems: Probabilities  advantages  formal foundation  reflection of reality (a posteriori)  problems  may be inappropriate  the future is not always similar to the past  inexact or incorrect  especially for subjective probabilities  ignorance  probabilities must be assigned even if no information is available  assigns an equal amount of probability to all such items  non-local reasoning  requires the consideration of all available evidence, not only from the rules currently under consideration  no compositionality  complex statements with conditional dependencies can not be decomposed into independent parts

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Bayesian Approaches  derive the probability of a cause given a symptom  has gained importance recently due to advances in efficiency  more computational power available  better methods  especially useful in diagnostic systems  medicine, computer help systems  inverse or a posteriori probability  inverse to conditional probability of an earlier event given that a later one occurred

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Bayes’ Rule for Single Event  single hypothesis H, single event E P(H|E) = (P(E|H) * P(H)) / P(E) or P(H|E) = (P(E|H) * P(H)) (P(E|H) * P(H) + P(E|  H) * P(  H) )

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Bayes’ Rule for Multiple Events  multiple hypotheses H i, multiple events E 1, …, E n P(H i |E 1, E 2, …, E n ) = (P(E 1, E 2, …, E n |H i ) * P(H i )) / P(E 1, E 2, …, E n ) or P(H i |E 1, E 2, …, E n ) = (P(E 1 |H i ) * P(E 2 |H i ) * …* P(E n |H i ) * P(H i )) /  k P(E 1 |H k ) * P(E 2 |H k ) * … * P(E n |H k )* P(H k ) with independent pieces of evidence E i

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Advantages and Problems of Bayesian Reasoning  advantages  sound theoretical foundation  well-defined semantics for decision making  problems  requires large amounts of probability data  sufficient sample sizes  subjective evidence may not be reliable  independence of evidences assumption often not valid  relationship between hypothesis and evidence is reduced to a number  explanations for the user difficult  high computational overhead

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Certainty Factors  denotes the belief in a hypothesis H given that some pieces of evidence E are observed  no statements about the belief means that no evidence is present  in contrast to probabilities, Bayes’ method  works reasonably well with partial evidence  separation of belief, disbelief, ignorance  share some foundations with Dempster-Shafer theory, but are more practical  introduced in an ad-hoc way in MYCIN  later mapped to DS theory

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Belief and Disbelief  measure of belief  degree to which hypothesis H is supported by evidence E MB(H,E) = 1 if P(H) =1 (P(H|E) - P(H)) / (1- P(H)) otherwise  measure of disbelief  degree to which doubt in hypothesis H is supported by evidence E MD(H,E) = 1 if P(H) =0 (P(H) - P(H|E)) / P(H)) otherwise

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Certainty Factor  certainty factor CF  ranges between -1 (denial of the hypothesis H) and +1 (confirmation of H)  allows the ranking of hypotheses  difference between belief and disbelief CF (H,E) = MB(H,E) - MD (H,E)  combining antecedent evidence  use of premises with less than absolute confidence  E 1  E 2 = min(CF(H, E 1 ), CF(H, E 2 ))  E 1  E 2 = max(CF(H, E 1 ), CF(H, E 2 ))   E =  CF(H, E)

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Combining Certainty Factors  certainty factors that support the same conclusion  several rules can lead to the same conclusion  applied incrementally as new evidence becomes available CF rev (CF old, CF new ) = CF old + CF new (1 - CF old ) if both > 0 CF old + CF new (1 + CF old ) if both < 0 CF old + CF new / (1 - min(|CF old |, |CF new |)) if one < 0

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Characteristics of Certainty Factors AspectProbability MBMB MDMD CFCF Certainly trueP(H|E) = 1101 Certainly false P(  H|E) = 1 01 No evidenceP(H|E) = P(H)000 Ranges measure of belief 0 ≤ MB ≤ 1 measure of disbelief 0 ≤ MD ≤ 1 certainty factor -1 ≤ CF ≤ +1

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Advantages and Problems of Certainty Factors  Advantages  simple implementation  reasonable modeling of human experts’ belief  expression of belief and disbelief  successful applications for certain problem classes  evidence relatively easy to gather  no statistical base required  Problems  partially ad hoc approach  theoretical foundation through Dempster-Shafer theory was developed later  combination of non-independent evidence unsatisfactory  new knowledge may require changes in the certainty factors of existing knowledge  certainty factors can become the opposite of conditional probabilities for certain cases  not suitable for long inference chains

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Possibility theory It is dealing with precise questions on the basis of imprecise knowledge. Example: An urn contains 10 balls, several of them red. What is the probability of drawing a red ball at random? We have to define “several” as a fuzzy set, e.g.: f {(3, 0.2), (4, 0.6), (5, 1.0), (6, 1.0), (7, 0.6), (8, 0.3)} The possibility distribution for p(RED) is now given by f(p(RED)) = SEVERAL/10

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Possibility theory f(p(RED)) evaluates to {(0.3, 0.2), (0.4, 0.6), (0.5, 1.0), (0.6, 1.0), (0.7, 0.6), (0.8, 0.3)} Meaning e.g.that there is 20% chance that p(RED) = 0.3 So f(p(RED)) can be regarded as a fuzzy probability.

سيستمهاي خبره و مهندسي دانش - دكتر كاهاني Summary  many practical tasks require reasoning under uncertainty  missing, inexact, inconsistent knowledge  variations of probability theory are often combined with rule-based approaches  works reasonably well for many practical problems  Bayesian networks have gained some prominence  improved methods, sufficient computational power