Professional Documents
Culture Documents
Uncertainty Management in Rule-Based Expert Systems
Uncertainty Management in Rule-Based Expert Systems
IF
A is true
THEN A is not false
Negnevitsky, Pearson Education, 2002
IF
A is false
THEN A is not true
2
Mean value
99
88
85
78
78
73
65
50
20
20
20
15
13
10
10
7
6
5
3
0
Term
Always
Very often
Usually
Often
Rather often
Frequently
Generally
About as often as not
Now and then
Sometimes
Occasionally
Once in a while
Not often
Usually not
Seldom
Hardly ever
Very seldom
Rarely
Almost never
Never
Mean value
100
87
79
74
74
72
72
50
34
29
28
22
16
16
9
8
7
5
2
0
5
and
p+q=1
Conditional probability
10
11
Hence,
p (B A) = p (B A) p (A)
and
p (A B ) = p (B A) p (A)
12
Bayesian rule
p (A B ) =
p (B A) p (A)
p (B )
where:
p(A|B) is the conditional probability that event A
occurs given that event B has occurred;
p(B|A) is the conditional probability of event B
occurring given that event A has occurred;
p(A) is the probability of event A occurring;
p(B) is the probability of event B occurring.
Negnevitsky, Pearson Education, 2002
13
i =1
i =1
B4
B3
B1
B2
14
p(A B ) =
p (B A) p(A)
15
Bayesian reasoning
Suppose all rules in the knowledge base are
represented in the following form:
IF
THEN
H is true
E is true {with probability p}
16
p (E H ) p(H )
p (E H ) p(H ) + p (E H ) p(H )
where:
p(H) is the prior probability of hypothesis H being true;
p(E|H) is the probability that hypothesis H being true will
result in evidence E;
p(H) is the prior probability of hypothesis H being
false;
p(E|H) is the probability of finding evidence E even
when hypothesis H is false.
Negnevitsky, Pearson Education, 2002
17
18
p (H i E ) =
p (E H i ) p(H i )
p(E H k ) p(H k )
k =1
p (E1 E2 . . . En H i ) p(H i )
p(E1 E2 . . . En H k ) p(H k )
k =1
Negnevitsky, Pearson Education, 2002
19
p (H i E1 E2 . . . En ) =
k =1
20
21
Hypothesis
i =1
i =2
i =3
p (H i )
0.40
0.35
0.25
p(E1 H i )
0.3
0.8
0.5
p(E2 H i )
0.9
0.0
0.7
p(E3 H i )
0.6
0.7
0.9
22
p(H i E3 ) =
p (E3 H i ) p(H i )
3
p(E3 H k ) p(H k )
i = 1, 2, 3
k =1
Thus,
0.6 0.40
= 0.34
p (H1 E3 ) =
0.6 0.40 + 0.7 0.35 + 0.9 0.25
0.7 0.35
p (H 2 E3 ) =
= 0.34
0.6 0.40 + 0.7 0.35 + 0.9 0.25
0.9 0.25
p(H 3 E3 ) =
= 0.32
0.6 0.40 + 0.7 0.35 + 0.9 0.25
23
p (E1 H i ) p (E3 H i ) p (H i )
i = 1, 2, 3
k =1
Hence,
p (H1 E1E3 ) =
24
p (H i E1E2 E3 ) =
3
i = 1, 2, 3
k =1
p (H 3 E1E2 E3 ) =
25
26
27
IF
the starter is bad
THEN the symptom is not odd noises {probability 0.15}
Negnevitsky, Pearson Education, 2002
28
29
30
31
<evidence>
<hypothesis> {cf }
32
if p(H ) = 1
otherwise
if p(H ) = 0
otherwise
33
MB(H, E ) MD(H, E )
cf =
1 - min[MB(H, E ), MD(H, E )]
Negnevitsky, Pearson Education, 2002
34
Example:
IF
A is X
THEN B is Y {cf 0.7};
B is Z {cf 0.2}
Negnevitsky, Pearson Education, 2002
35
36
37
38
IF
B is Y
THEN C is Z {cf 0.6}
39
40
cf1 + cf2
if cf1 < 0 or cf2 < 0
cf (cf1, cf2) =
1 min [|cf1|, |cf1|]
where:
cf1 is the confidence in hypothesis H established by Rule 1;
cf2 is the confidence in hypothesis H established by Rule 2;
|cf1| and |cf2| are absolute magnitudes of cf1 and cf2,
respectively.
Negnevitsky, Pearson Education, 2002
41
42
43
44
45
46