2020 Ingeniería en Computacion

Chap 3: Fuzzy Rules

and Fuzzy Reasoning

Juan R. Castro
FCQI, UABC Campus Tijuana
[email protected]
 2012 Ingeniería en Computacion

Outline
Extension principle
Fuzzy relations
Fuzzy if-then rules
Compositional rule of inference
Fuzzy reasoning

2
 2012 Ingeniería en Computacion

Extension Principle

3
 2012 Ingeniería en Computacion

Extension Principle

4
 2012 Ingeniería en Computacion

Extension Principle
A is a fuzzy set on X :
A   A ( x1 ) / x1   A ( x2 ) / x2   A ( xn ) / xn

The image of A under f( ) is a fuzzy set B:

B   B ( x1 ) / y1   B ( x2 ) / y2   B ( xn ) / y n
where yi = f(xi), i = 1 to n.
If f( ) is a many-to-one mapping, then

5
 2012 Ingeniería en Computacion

Fuzzy Relations
A fuzzy relation R is a 2D MF:
R  {(( x , y ),  R ( x , y ))|( x , y )  X  Y}

Examples:
• x is close to y (x and y are numbers)
• x depends on y (x and y are events)
• x and y look alike (x, and y are persons or objects)
• If x is large, then y is small (x is an observed
reading and Y is a corresponding action)

6
 2012 Ingeniería en Computacion

Max-Min Composition
The max-min composition of two fuzzy relations R1 (defined on X and Y) and R2 (defined on Y and Z) is

Properties:
• Associativity:
• Distributivity over union:

• Week distributivity over intersection:

• Monotonicity:

 R  R ( x , z )  [ R ( x , y )   R ( y , z )]
1 2 1 2
y

R  (S  T )  ( R  S )  T

R  ( S T )  ( R  S ) ( R  T )

R  ( S T )  ( R  S ) ( R  T )

7 S  T  (R  S)  (R T )
 2012 Ingeniería en Computacion

Max-Star Composition
Max-product composition:

In general, we have S-T composition:

where * is a T-norm operator.

8
 2012 Ingeniería en Computacion

Fuzzy Relations

9
 2012 Ingeniería en Computacion

Linguistic Variables
A numerical variables takes numerical values:
Age = 65
A linguistic variables takes linguistic values:
Age is old
A linguistic values is a fuzzy set.
All linguistic values form a term set:
T(age) = {young, not young, very young, ...
middle aged, not middle aged, ...
old, not old, very old, more or less old, ...
not very yound and not very old, ...}

10
 2012 Ingeniería en Computacion

Linguistic Values (Terms)

11
complv.m
 2012 Ingeniería en Computacion

Operations on Linguistic Values

Concentration: CON ( A)  A2

Dilation: DIL( A)  A0.5

Contrast  2 A2 , 0   A ( x )  0.5
INT ( A)  
intensification:   2( A ) 2
, 0.5   A ( x )  1

12 intensif.m
 2012 Ingeniería en Computacion

Fuzzy If-Then Rules

General format:
If x is A then y is B
Examples:
• If pressure is high, then volume is small.
• If the road is slippery, then driving is dangerous.
• If a tomato is red, then it is ripe.
• If the speed is high, then apply the brake a little.

13
 2012 Ingeniería en Computacion

Fuzzy If-Then Rules

Two ways to interpret “If x is A then y is B”:

A coupled with B A entails B

y y

B B

x x
A A
14
 2012 Ingeniería en Computacion

Fuzzy If-Then Rules

Two ways to interpret “If x is A then y is B”:
• A coupled with B: (A and B)
~
R  A B  A B   A ( x )   B ( y )|( x , y )

• A entails B: (not A or B)
- Material implication
- Propositional calculus
- Extended propositional calculus
- Generalization of modus ponens

15
 2012 Ingeniería en Computacion

Fuzzy If-Then Rules

Fuzzy implication function:
 R ( x , y )  f (  A ( x ),  B ( y ))  f ( a, b)

A coupled with B

16 fuzimp.m
 2012 Ingeniería en Computacion

Fuzzy If-Then Rules

A entails B

17
fuzimp.m
 2012 Ingeniería en Computacion

Compositional Rule of Inference

Derivation of y = b from x = a and y = f(x):
y y

b b

y = f(x) y = f(x)

a x x
a
a and b: points
a and b: intervals
y = f(x) : a curve
y = f(x) : an interval-valued
18 function
 2012 Ingeniería en Computacion

Compositional Rule of Inference

a is a fuzzy set and y = f(x) is a fuzzy relation:

19 cri.m
 2012 Ingeniería en Computacion

Fuzzy Reasoning
Single rule with single antecedent
Rule: if x is A then y is B
Fact: x is A’
Conclusion: y is B’ = A’ o (AxB)
Graphic Representation:
A’ A B
w

X Y
A’
B’

X Y
x is A’ y is B’
20
 2012 Ingeniería en Computacion

Fuzzy Reasoning
Single rule with multiple antecedent
Rule: if x is A and y is B then z is C
Fact: x is A’ and y is B’
Conclusion: z is C’ = [A’ o (AxC)] Π [B’ o (BxC)]
Graphic Representation:
A’ A B’ B T-norm C
w

Z
X Y
A’ B’
C’
Z
x is A’ X y is B’ Y z is C’
21
 2012 Ingeniería en Computacion

Fuzzy Reasoning
Multiple rules with multiple antecedent
Rule 1: if x is A1 and y is B1 then z is C1
Rule 2: if x is A2 and y is B2 then z is C2
Fact: x is A’ and y is B’
Conclusion: z is C’ = {[A’ o (A1xC1)] Π [B’ o (B1xC1)]} U
{[A’ o (A2xC2)] Π [B’ o (B2xC2)]}

Graphic Representation: (next slide)

22
 2012 Ingeniería en Computacion

Fuzzy Reasoning
Graphics representation:
A’ A1 B’ B1 C1
w1
Z
X Y
A’ A2 B’ B2 C2
w2

Z
X Y
T-norm
A’ B’
C’
Z
x is A’ X y is B’ Y z is C’
23
 2012 Ingeniería en Computacion

Fuzzy Reasoning: MATLAB Demo

>> ruleview mam21

24
 2012 Ingeniería en Computacion

Fuzzy Reasoning: MATLAB Demo

25
 2012 Ingeniería en Computacion

Fuzzy Reasoning: MATLAB Demo

26
 2012 Ingeniería en Computacion

Other Variants
Some terminology:
• Degrees of compatibility (match)
• Firing strength
• Qualified (induced) MFs
• Overall output MF

27