Chapter 10 Reasoning Under Uncertainty
Chapter 10 Reasoning Under Uncertainty
Knowledge-Based
Systems
Chapter 9: Reasoning
Under Uncertainty
computational complexity
◦ feasibility of calculations for practical purposes
likelihood of evidence
◦ for each premise
◦ for the conclusion
◦ combination of evidence from multiple premises
So conditional probabilities reflect the fact that some events make other events
more (or less) likely
If one event doesn’t affect the likelihood of another event they are said to be
independent and therefore
P ( a | b) P ( a )
E.g. if you roll a 6 on a die, it doesn’t make it more or less likely that you will roll a
6 on the next throw. The rolls are independent.
inverse probability
◦ inverse to conditional probability of an earlier event given that a later
one occurred
P (a b) P (a | b) P (b) P (b | a ) P (a )
P (a | b) P (b) P (b | a ) P (a )
P (b | a ) P (a )
P ( a | b)
P (b)
If we model how likely observable effects are given hidden causes (how likely
toothache is given a cavity)
Then Bayes’ rule allows us to use that model to infer the likelihood of the hidden
cause (and thus answer our question)
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
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
CFrev(CFold, CFnew) =
CFold + CFnew(1 - CFold) if both > 0
CFold + CFnew(1 + CFold) if both < 0
CFold + CFnew / (1 - min(|CFold|, |CFnew|)) if one < 0
Ranges
◦ measure of belief 0 ≤ MB ≤ 1
◦ measure of disbelief 0 ≤ MD ≤ 1
◦ certainty factor -1 ≤ CF ≤ +1
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
plausibility Pls(A)
◦ maximum belief of A
◦ upper bound for the range of belief
certainty Cer(A)
◦ interval [Bel(A), Pls(A)]
◦ also called evidential interval
◦ expresses the range of belief
problems
◦ non-intuitive determination of mass probability
◦ very high computational overhead
◦ may produce counterintuitive results due to normalization
◦ usability somewhat unclear