11 Fuzzy Rule-Based

Models

Fuzzy Systems Engineering

Toward Human-Centric Computing

Contents
11.1 Fuzzy rules as a vehicle of knowledge representation
11.2 General categories of fuzzy rules and their semantics
11.3 Syntax of fuzzy rules
11.4 Basic functional modules
11.5 Types of rule-based systems and architectures
11.6 Approximation properties of fuzzy rule-based models
11.7 Development of rule-based systems

Pedrycz and Gomide, FSE 2007

11.8 Parameter estimation procedure for functional

rule-based systems
11.9 Design of rule-based systems: consistency,
completeness and the curse of dimensionality
11.10 Course of dimensionality in rule-based systems
11.11 Development scheme of fuzzy rule-based models

Pedrycz and Gomide, FSE 2007

11.1 Fuzzy rules as a vehicle of

knowledge representation

Pedrycz and Gomide, FSE 2007

Rule conditional statement

If input variable is A then output variable is B
A and B: descriptors of pieces of knowledge
rule: expresses a relationship between inputs and outputs
Example
If the temperature is high then the electricity demand is high
If and then parts ....... formed by information granules
sets
rough sets
fuzzy sets
Pedrycz and Gomide, FSE 2007

Rule-based system/model (FRBS)

FRBS is a family of rules of the form
If input variable is Ai then output variable is Bi
i = 1, 2,..., c
Ai and Bi are information granules
More complex rules
If input variable1 is Ai and input variable2 is Bi and .....
then output variable is Zi
multidimensional input space (Cartesian product of inputs)
individual inputs aggregated by the and connective
highly parallel, modular granular model
Pedrycz and Gomide, FSE 2007

11.2 General categories of fuzzy

rules and their semantics

Pedrycz and Gomide, FSE 2007

Multi-input multi-output fuzzy rules

If X1 is A1 and X2 is A2 and ..... and Xn is An
then Y1 is B1 and Y2 is B2 and ..... and Ym is Bm
Xi = variables whose values are fuzzy sets Ai
Yj = variables whose values are fuzzy sets Bj
Ai on Xi, i = 1, 2,...,n
Bj on Yj, j = 1, 2,...,m
No loss of generality if we assume rules of the form
If X is A and Y is B then Z is C

Pedrycz and Gomide, FSE 2007

Certainty-qualified rules

If X is A and Y is B then Z is C with certainty

[0,1]
: degree of certainty of the rule
= 1 rule is certain

Pedrycz and Gomide, FSE 2007

Gradual rules
the more X is A the more Y is B
relationships between changes in X and Y
captures tendency between information granules

Examples:
the higher the income, the higher the taxes
the lower the temperature, the higher energy consumption

Pedrycz and Gomide, FSE 2007

Functional fuzzy rules

If X is Ai then y = f (x,ai)
f:XY
xRn
Rule: confines the function to the support of granule Ai
f : linear or nonlinear (neural nets, etc..)
Highly modular models

Pedrycz and Gomide, FSE 2007

11.3 Syntax of fuzzy rules

Pedrycz and Gomide, FSE 2007

Backus-Naur form (BNF)

If_then_rule ::= if antecedent then consequent{certainty}

gradual_rule ::= word antecedentword consequent
word ::= more {less}
antecedent ::= expression
consequent ::= expression
expression ::= disjunction{and disjunction}
disjunction ::= variable{orvariable}
variable ::= attribute is value
certainty ::= none{certainty [0,1]}

Pedrycz and Gomide, FSE 2007

Construction of computable representations

Main steps:
1. specification of the fuzzy variables to be used
2. association of the fuzzy variables using fuzzy sets
3. computational formalization of each rule using fuzzy
relations and definition of aggregation operator to combine
rules together

Pedrycz and Gomide, FSE 2007

11.4 Basic functional

modules of FRBS

Pedrycz and Gomide, FSE 2007

General architecture of FRBS

Rule
Base

Parameters
of the FRBS

Data
Base

Fuzzy
Inference

Output Interface

Input Interface

Fuzzy if-then rules

(input-output relationship)

Process inputs and rules

(approximate reasoning)
Pedrycz and Gomide, FSE 2007

Input interface
(attribute) of (input) is (value)
the temperature of the motor is high
Canonical (atomic) form
p: X is A

temperature (motor) is high

X
A
fuzzy set

Low

Medium

High

x (C)

Pedrycz and Gomide, FSE 2007

Multiple fuzzy inputs: conjunctive canonical form

p : X1 is A1 and X2 is A2 and ..... and Xn is An

conjunctive canonical form

Xi are fuzzy (linguistic) variables

Ai : fuzzy sets on Xi
i = 1, 2, ..., n
Compound proposition induces a fuzzy relation P on X1X1... Xn
n

P( x1 , x2 ,K , xn ) = A1 ( x1 )tA2 ( x2 )t KtAn ( xn ) = T Ai ( xi )
i =1

t (T) = t-norm

p : (X1, X2 , ....., Xn) is P

Pedrycz and Gomide, FSE 2007

Example
Fuzzy relation associated with (X,Y) is P
Triangular fuzzy sets A1(x,4,5,6) = A, A2(y,8,10,12) = B
t-norm: algebraic product

(b) Contours of P
y

20

P
10

0
0

10

Pedrycz and Gomide, FSE 2007

Multiple fuzzy inputs: disjunctive canonical form

q : X1 is A1 or X2 is A2 or ..... or Xn is An

disjunctive canonical form

Xi are fuzzy (linguistic) variables

Ai : fuzzy sets on Xi
i = 1, 2, ..., n
Compound proposition induces a fuzzy relation Q on X1X1... Xn
n

Q( x1 , x2 ,K , xn ) = A1 ( x1 ) sA2 ( x2 ) s K sAn ( xn ) = S Ai ( xi )
i =1

s (S) = t-conorm

q : (X1, X2 , ....., Xn) is Q

Pedrycz and Gomide, FSE 2007

Example
Fuzzy relation associated with (X,Y) is Q
Triangular fuzzy sets A1(x,4,5,6) = A, A2(y,8,10,12) = B
t-conorm: probabilistic sum
(d) Contours of Q

20

10

0
0

10

Pedrycz and Gomide, FSE 2007

Rule base
Fuzzy rule: If X is A then Y is B relationship between X and Y
Semantics of the rule is given by a fuzzy relation R on XY
R determined by a relational assignment
R(x,y) = f (A(x),B(y)) (x, y)XY
f : [0,1]2 [0,1]
In general f can be
fuzzy conjunction: ft
fuzzy disjunction: fs
fuzzy implication: fi
Pedrycz and Gomide, FSE 2007

Fuzzy conjunction
Choose a t-norm t and define:
R(x,y) ft (x,y) = A(x) t B(y) (x,y) XY
Examples:
t = min
Rc(x,y) fc (x,y) = min[A(x) t B(y)]

(Mamdani)

t = algebraic product
Rp(x,y) fp (x,y) = A(x)B(y)

(Larsen)

Pedrycz and Gomide, FSE 2007

Example: t = min

Rc(x,y) = min {A(x), B(y)}

(A(x), B(y))[0,1]2

Rc(x,y) = min {A(x), B(y)}

A(x) = A(x,4,5,6)
B(y) = B(y,4,5,6)

Pedrycz and Gomide, FSE 2007

Example: t = algebraic product

Rp(x,y) =A(x)B(y)
(A(x), B(y))[0,1]2

Rp(x,y) = A(x)B(y)
A(x) = A(x,4,5,6)
B(y) = B(y,4,5,6)

Pedrycz and Gomide, FSE 2007

Fuzzy disjunction
Choose a t-conorm s and define:
Rs(x,y) fs (x,y) = A(x) s B(y) (x,y) XY
Examples:
s = max
Rm(x,y) fm (x,y) = max[A(x) t B(y)]
s = Lukasiewicz t-conorm
Rl (x,y) fl (x,y) = min[1, A(x) + B(y)]

Pedrycz and Gomide, FSE 2007

Example: s = max

Rl (x,y) = max{A(x), B(y)}

(A(x), B(y))[0,1]2

Rl (x,y) = max {A(x), B(y)}

A(x) = A(x,4,5,6)
B(y) = B(y,4,5,6)

Pedrycz and Gomide, FSE 2007

Example: s = Lukasiewicz

Rc(x,y) = min{1, A(x)+B(y)}

(A(x), B(y))[0,1]2

Rc(x,y) = min{1, A(x)+B(y)}

A(x) = A(x,4,5,6)
B(y) = B(y,4,5,6)

Pedrycz and Gomide, FSE 2007

Fuzzy implication
Choose a fuzzy implication fi and define:
Ri(x,y) fi (x,y) (x,y) XY

fi : [0,1]2 [0,1] is a fuzzy implication if:

1. B(y1) B(y2) fi (A(x), B(y1)) fi (A(x), B(y2))

monotonicity 2nd argument

2. fi (0, B(y)) = 1

dominance of falsity

3. fi (1, B(y)) = B(y)

neutrality of truth

Pedrycz and Gomide, FSE 2007

 Further requirements may include:

4. A(x1) A(x2) fi (A(x1), B(y)) fi (A(x2), B(y))

monotonicity 1st argument

5. fi (A(x1), fi (A(x2), B(y)) = fi (A(x2), fi (A(x1), B(y))

exchange

6. fi (A(x), A(x)) = 1

identity

7. fi (A(x), B(y)) = 1 A(x) B(y)

boundary condition

8. fi is a continuous function

continuity

Pedrycz and Gomide, FSE 2007

Examples of fuzzy implications

Name
Lukasiewicz

Definition

Comment

fl(A(x), B(y)) = min [1, 1 A(x) + B(y)]

Pseudo-Lukasiewicz

1 A( x) + ( + 1) B( y )
f ( A( x) , B( y )) = min 1,

1 + A( x)

> -1

Pseudo-Lukasiewicz

f w ( A( x ) , B ( y )) = min [1, (1 A( x ) w + B ( y ) w )1 / w ]

w> 0

Gaines
Gdel
Goguen

1 if A( x) B( y )
f a ( A( x) , B( y )) =
otherwise
0
if A( x) B( y )
1
f g ( A( x) , B ( y )) =
otherwise
B( y)
if A( x) B ( y )
1
B( y )
f e ( A( x) , B( y )) =
otherwise
A( x)

Kleene

f b ( A( x) , B( y )) = max [1 A( x) , B ( y )]

Reichenbach

f r ( A( x) , B( y )) = 1 A( x) + A( x) B( y )]

Zadeh
Klir-Yuan

f z ( A( x) , B( y )) = max [1 A( x) , min ( A( x) , B( y ))]

f k ( A( x) , B( y )) = 1 A( x) + A( x) 2 B( y )
Pedrycz and Gomide, FSE 2007

Example: fl = Lukasiewicz

Rl (x,y) = min{1, 1 A(x)+B(y)}

(A(x), B(y))[0,1]2

Rl (x,y) = min{1, 1 A(x)+B(y)}

A(x) = A(x,4,5,6)
B(y) = B(y,4,5,6)

Pedrycz and Gomide, FSE 2007

Example: fk = KlirYuan

Rk (x,y) = 1 A(x)+A(x)2B(y)
(A(x), B(y))[0,1]2

Rk (x,y) = 1 A(x)+A(x)2B(y)
A(x) = A(x,4,5,6)
B(y) = B(y,4,5,6)

Pedrycz and Gomide, FSE 2007

 Categories of fuzzy implications:

1. s-implications
fis ( A( x), B ( y )) = A ( x) sB ( y )

( x , y ) X Y

fb ( A( x), B ( y )) = max[1 A( x) , B ( y )]

Kleene

f g ( A( x), B( y )) = min{1, 1 A( x) + B ( y )} Lukasiewicz

2. r-implications
fir ( A( x), B ( y )) = sup[c [0 ,1] | A( x) t c B( y )]

( x , y ) X Y

t = min
if A( x) B ( y )
1
f g ( A( x), B ( y )) =
B( y ) A( x) > B( y )

Gdel
Pedrycz and Gomide, FSE 2007

Semantics of gradual rules

the more X is A, the more Y is B

B(y) A(x) xX and yY

B(y)
1.0

1.0

A(x)
BRd
x

BRd = {yY |B(y) A(x)} for each xX

Pedrycz and Gomide, FSE 2007

Example: Rd = fa = Gaines
1 if B ( y ) A( x)
Rd ( x, y ) =
0 otherwise
(a) Gradual rule Rd = fa

1
0.8
0.6
0.4
0.2
0
1

B(y)
0.8 A(x)

0.5

0.6
0.4
0.2
0

Rd(x,y)
(A(x), B(y))[0,1]2

Rd (x,y)
A(x) = A(x,3,5,7)
B(y) = B(y,3,5,7)
Pedrycz and Gomide, FSE 2007

Main types of rule bases

Fuzzy rule base {R1, R2,....,RN} finite family of fuzzy rules
Fuzzy rule base can assume various formats:
1. fuzzy graph
Ri: If X is Ai then Y is Bi is a fuzzy granule in XY, i = 1,...,N
2. fuzzy implication rule base
Ri: If X is Ai then Y is Bi is fuzzy implication, i = 1,...,N
3. functional fuzzy rule base
Ri: If X is Ai then y = fi(x) is a functional fuzzy rule, i = 1,...,N

Pedrycz and Gomide, FSE 2007

Fuzzy graph
Fuzzy rule base R collection of rules R1, R2,....,RN
Each fuzzy rule Ri is a fuzzy granule (point)
Fuzzy graph R is a collection of fuzzy granules
granular approximation of a function
N

i =1

i =1

R = U Ri = U ( Ai Bi )

R = R1 or R2 or....or RN
general form
N

R( x, y ) = S [ Ai ( x)tBi ( y )]
i=1

Pedrycz and Gomide, FSE 2007

Point
(a)

(b)

10

10

y
4

P
4

B(y)

8 x 10

(c)
1

A(x)

Point P in XY
P = AB
A is a singleton in X
B is a singleton in Y

0
0

8 x 10

Pedrycz and Gomide, FSE 2007

Granule
(a)

(b)

10

10

6
4

B(y)

8 x 10

8 x 10

(c)
1

A
A(x)

Granule G in XY
G = AB
A is an interval in X
B is an interval in Y

0
0

Pedrycz and Gomide, FSE 2007

Fuzzy granules fuzzy points

(b) Fuzzy granule R

(a)
10

10

B(y)

10

(c)
1

fuzzy granule R in XY
R = AB
A is a fuzzy set on X
B is a fuzzy set on Y

A(x)

0
0

8 x 10

Pedrycz and Gomide, FSE 2007

Fuzzy rule base as a set fuzzy granules

(b) Fuzzy granules Ri
(a)

10

10

R1

8
B1

R2

7
B2

R3

6
B3

R4

5
B4
4

R5

4
B5

3
2

2
1

0
1

B(y)

0
0

x 10

(c)

A1

A2

A3

A4

A5

Ri = AiBi

0
0

10

Pedrycz and Gomide, FSE 2007

Graph of a function f and its granular approximation R

(a) function y = f(x)

(b)Granular approximation of y = f(x)

12

12
11

10

10

Ri = AiBi

R1
9

R2

R3

R4
5

f
4

R5 R6

R7

R8

2
1

0
0

10

12

10

11 x 12

Pedrycz and Gomide, FSE 2007

Fuzzy rule base and fuzzy graph

Example 1
(b)Fuzzy rule base as a fuzzy graph (t = min)
10

9
8
7

R = Union Ri
6
5
4
3
2
1
0
0

9 x

10

Ri = AiBi Ri(x,y) = min [Ai(x), Bi(y)]

R = Ri R(x,y) = max [Ri(x,y), i = 1,..., N ]
Pedrycz and Gomide, FSE 2007

Fuzzy rule base and fuzzy graph

Example 2
(d) Fuzzy rule base as a fuzzy graph (t = product)
10

y
9
8
7

R = Union Ri
6
5
4
3
2
1
0
0

9 x

10

Ri = Ai t Bi Ri(x,y) = Ai(x) Bi(y)

R = Ri R(x,y) = max [Ri(x,y), i = 1,..., N ]
Pedrycz and Gomide, FSE 2007

Fuzzy implication
Fuzzy rule base R collection of rules R1, R2,....,RN
Each fuzzy rule Ri is a fuzzy implication
Fuzzy rule base R is a collection of fuzzy relations
relation R is obtained using intersection
N

i =1

i =1

i =1

R = I Ri = I fi = I ( Ai Bi )

R = R1 and R2 and....and RN
general form
N

R = T fi ( Ai ( x) , Bi ( y ))
i=1

Pedrycz and Gomide, FSE 2007

Fuzzy rule as an implication

(a)

(b) Lukasiewicz implication R

10

10

6
4

B(y)

8 x 10

8 x 10

(c)
1

fuzzy rule R in XY
R = fl (A,B)
Lukasiewicz implication

A
A(x)

0
0

Pedrycz and Gomide, FSE 2007

Fuzzy rule base and fuzzy implication

Example 1a
(b) Fuzzy rule base as Lukasiewicz implication (t = min)
10
9
8
7

6
5
4
3
2
1
0
0

10

Ri = fl (A,B) Ri(x,y) = min [1, 1 Ai(x) + Bi(y)] Lukasiewicz implication

R = Ri R(x,y) = min [Ri(x,y), i = 1,..., 5]

min t-norm
Pedrycz and Gomide, FSE 2007

Fuzzy rule base and fuzzy implication

Example 1b
(b) Fuzzy rule base as Lukasiewicz implication (t = min)
10
9
8
7

6
5
4
3
2
1
0
0

10

Ri = fl (A,B) Ri(x,y) = min [1, 1 Ai(x) + Bi(y)]

Lukasiewicz implication

R = Ri R(x,y) = R1(x,y) tl R2(x,y) tl .... tl Ri(x,y) Lukasiewicz t-norm

Pedrycz and Gomide, FSE 2007

Fuzzy rule base and fuzzy implication

Example 2a
(b) Fuzzy rule base as Zadeh implication (t = min)
y

10
9
8
7
6
5
4
3
2
1
0
0

Ri = fz (A,B) Ri(x,y) = max [1 Ai(x), min(Ai(x), Bi(y)]

R = Ri R(x,y) = min [Ri(x,y), i = 1,..., 5]

9 x 10

Zadeh implication
min t-norm
Pedrycz and Gomide, FSE 2007

Fuzzy rule base and fuzzy implication

Example 2b
(d) Fuzzy rule base as Zadeh implication (t = Lukasiewicz)
y

10
9
8
7
6
5
4
3
2
1
0
0

Ri = fz (A,B) Ri(x,y) = max [1 Ai(x), min(Ai(x), Bi(y)]

R = Ri R(x,y) = R1(x,y) tl R2(x,y) tl .... tl Ri(x,y)

9 x

10

Zadeh implication
Lukasiewicz t-norm
Pedrycz and Gomide, FSE 2007

Data base
Data base contains definitions of:
universes
scaling functions of input and output variables
granulation of the universes membership functions
Granulation
granular constructs in the form of fuzzy points
granules along different regions of the universes
Construction of membership functions
expert knowledge
learning from data

Pedrycz and Gomide, FSE 2007

Granulation

granular constructs in
the form of fuzzy points

granules along different

regions of the universes

Pedrycz and Gomide, FSE 2007

Fuzzy inference
Basic idea of inference
(a)
12

x=a
y = f (x)
y=b

ac
10

b = ProjY (ac f )

0
0

10

12

b = ProjY ( I )

Pedrycz and Gomide, FSE 2007

Inference involves operations with sets

(b)
12

x=A
y = f (x)
B = f (A) ={f (x), xA}

10

Ac

B = ProjY (Ac f )

A
0
0

10

12

B = ProjY ( I )

Pedrycz and Gomide, FSE 2007

Inference involving sets and relations

(a)
12

x is A
(x,y) is R
y is B

10

Ac

B
I

B = ProjY (Ac R )

A
0
0

10

12

B = ProjY ( I )

Pedrycz and Gomide, FSE 2007

Fuzzy inference ands operations with fuzzy sets and relations

(b)
y

12

Ac
10

X is A
(fuzzy set on X)
(X,Y) is R (fuzzy relation on XY)
Y is B
(fuzzy set on Y)

B
I

f
2

A
2

10

12

B = ProjY (Ac R )

B = ProjY ( I )

B ( y ) = sup { A( x )tR ( x , y )}
xX

Pedrycz and Gomide, FSE 2007

Fuzzy inference
Compositional rule of inference
X is A
(X,Y) is R
Y is B

B = Ao R
X is A
(X,Y) is R
Y is AoR

Pedrycz and Gomide, FSE 2007

Fuzzy inference procedure

procedure FUZZY-INFERENCE (A, R) returns a fuzzy set
input : fuzzy relation: R
fuzzy set: A
local: x, y: elements of X and Y
t: t-norm
for all x and y do
Ac(x,y) A(x)
for all x and y do
I(x,y) Ac(x,y) t R(x,y)
B(y) supx I(x,y)
return B

Pedrycz and Gomide, FSE 2007

Example: compositional rule of inference

Pedrycz and Gomide, FSE 2007

Example: fuzzy inference with fuzzy graph

Pedrycz and Gomide, FSE 2007

11.5 Types of rule-based

systems and architectures

Pedrycz and Gomide, FSE 2007

Linguistic fuzzy models

P:

X is A and Y is B

input

R1:

rule base

RN:

If X is A1 and Y is B1 then Z is C1
......................
If X is Ai and Y is Bi then Z is Ci
.......................
If X is AN and Y is BN then Z is CN

Z:

Z is C

output

Ri:

all fuzzy sets A, B, Ai,s and Bi,s are given

rule and connectives (and, or) with known semantics
membership function of fuzzy set C = ??
Pedrycz and Gomide, FSE 2007

min-max fuzzy models

Assume
P:

X is A and Y is B

Ri: If X is Ai and Y is Bi then Z is Ci

P(x,y) = min{A(x), B(y)}

Ri(x,y,z) = min{Ai(x), Bi(y), Ci(z)}

i = 1,..., N
Using the compositional rule of inference (t = min)
N

C = P o R = P o U Ri
i =1

C ( z ) = sup{min[ P ( x , y ), max( Ri ( x , y , z ), i = 1,...,N )]}

x ,y

Pedrycz and Gomide, FSE 2007

i =1

i =1

i =1

C = P o R = P o U Ri = U ( P o Ri ) = U Ci
Ci = P o Ri
Ci ( z ) = sup{min[ P ( x , y ), Ri ( x , y , z )]} = sup{ A( x) B ( y ) Ai ( x) Bi ( y ) Ci ( z )]}
x ,y

x ,y

sup[ A( x) Ai ( x)] = Poss( A, Ai ) = mi

x

sup[ B ( y ) Bi ( y )] = Poss( B , Bi ) = ni
y

Ci ( z ) = mi ni Ci ( z )
C ( z ) = max{( mi ni )Ci ,i = 1,K , N } = max{i Ci ( z ), i = 1,K , N }
i is the degree of activation of i th rule

Pedrycz and Gomide, FSE 2007

min-max fuzzy model processing

procedure MIN-MAX-MODEL (A,B) returns a fuzzy set
local: fuzzy sets: Ai, Bi, Ci, i =1,.., N
activation degrees: i
Initialization C =
for i = 1: N do
mi = max (min (A, Ai))
ni = max (min (B, Bi))
i = min (mi, ni)
if i 0 then Ci = min (i , Ci) and C = max(C, Ci)
return C

Pedrycz and Gomide, FSE 2007

Example: min-max fuzzy model processing

1
mj

Ai Aj A

Bi

B Bj

mi
y

Cj
Cj

nj

nj
ni

mi

Ci

Ci
z

Pedrycz and Gomide, FSE 2007

min-max fuzzy model architecture

A1,B1
Poss

C1

Ai,Bi
(A,B)

Poss

C1

Ci

AN,BN
Poss

Min

C
Min

Ci

Max

CN

Min

CN

Pedrycz and Gomide, FSE 2007

Special case: numeric inputs

1 if x = xo
A( x) =
0 otherwise

1 if y = yo
and B ( y ) =
0 otherwise

Numeric output
zC ( z )dz
z= Z
Z C ( z )dz

centroid defuzzification

(mi ni )vi

z = i =1

weighted average modal values vi

(mi ni )

i =1

Pedrycz and Gomide, FSE 2007

Example
(xo, yo), xo, yo [-2, 2]

inputs

P:

X is xo and Y is yo

R1:

If X is A1 and Y is B1 then Z is C1
rules

R2:

If X is A2 and Y is B2 then Z is C2

N = 2,

centroid defuzzification
(a) Input and output fuzzy sets
A1

Ai(x)

(b) Input-output mapping

A2

0.5

-1.5

Bi(y)

-0.5

0.5

B2

1.5

B2

-0.5

0.5
0
-2

-1.5

-1

-0.5

0.5

C1

Ci(z)

-1

0.5

0
-2

1.5

-2

y
-1

C2

0.5
1

0
-2

-1

-2

-1.5

-1

-0.5

0.5

1.5

1
2

Pedrycz and Gomide, FSE 2007

min-sum fuzzy models

Assume
P:

X is A and Y is B

Ri: If X is Ai and Y is Bi then Z is Ci

P(x,y) = min{A(x), B(y)}

Ri(x,y,z) = min{Ai(x), Bi(y), Ci(z)}

i = 1,..., N
Using the compositional rule of inference (t = min)
Ci ( z ) = sup[ A( x ) B ( y ) Ai ( x) Bi ( y ) Ci ( z )]
x ,y

C ( z) =

wiCi

Additive fuzzy models

(Kosko, 1992)

i =1

Pedrycz and Gomide, FSE 2007

Example: min-sum fuzzy model processing

1
mj

Ai Aj A

Bi

B Bj

mi
y

Cj
Ci

nj

nj
ni

mi

Ci

Ci

Cj
z

Pedrycz and Gomide, FSE 2007

min-sum fuzzy model architecture

A1,B1
Poss

C1

Ai,Bi
(A,B)

Poss

C1
w1

Ci

AN,BN
Poss

Min

Min
CN

Min

wi
Ci

wN
CN

Pedrycz and Gomide, FSE 2007

Example
(xo, yo), xo, yo [-2, 2]

inputs

P:

X is xo and Y is yo

R1:

If X is A1 and Y is B1 then Z is C1
rules

R2:

If X is A2 and Y is B2 then Z is C2

N=2

w1 = w2 = 1, centroid defuzzification
(a) Input and output fuzzy sets
A1

Ai(x)

(b) Input-output mapping

A2

0.5

-1.5

-1

-0.5

0.5

1.5

0.5
0
-2

B2

Bi(y)

-0.5
0.5
0
-2

-1.5

-1

-0.5

0.5

C1

Ci(z)

B2

1.5

-2

y
-1

C2

0
0.5
1
0
-2

-1

-2

0
-1.5

-1

-0.5

0.5

1.5

1
2

Pedrycz and Gomide, FSE 2007

product-sum fuzzy models

1- Productprobabilistic sum
0.5

Ci ( z ) = mi ni Ci ( z )

(b) Input-output mapping of product-probabilistic sum model

0
-0.5

N
C ( z ) = S p Ci ( z )
i =1

-2

y
-1
0
1

-1

-2

-1

-2

0
2

2- Productsum

(d) Input-output mapping of product-sum model

0.5

Ci ( z ) = mi ni Ci ( z )

1
2

0
-0.5

C ( z ) = Ci ( z )
i =1

-2

y
-1
0
1
0
2

1
2

Pedrycz and Gomide, FSE 2007

3 - Bounded product-bounded sum

Ci ( z ) = mi ni Ci ( z )

(c) Input-output mapping of bounded product-bounded sum model

C ( z ) = Ci ( z )
i =1

1
0.5
0
-0.5

a b = max{0 , a + b 1}

-1
-2

a b = min{1, a + b}

-1
0

a,b [0 ,1]

-1

-2

0
2

1
2

Pedrycz and Gomide, FSE 2007

Functional fuzzy models

P:

X is x and Y is y

input

R1:

If X is A1 and Y is B1 then z = f1 (x,y)

......................
If X is Ai and Y is Bi then z = fi (x,y)
.......................
If X is AN and Y is BN then z = fN (x,y)

rule base

i(x,y) = Ai(x) t Bi(y) t = t-norm

degree of activation

Ri:
RN:

z = wi ( x , y ) fi ( x , y ) ,
i =1

wi =

i
N

i ( x , y )

output

i =1

Pedrycz and Gomide, FSE 2007

Functional fuzzy model architecture

f1(x,y)

A1,B1

w1

f2(x,y)

Ai,Bi
(x,y)

wi

fN(x,y)

AN,BN

wN

Pedrycz and Gomide, FSE 2007

Example 1
x [0, 3]

inputs

P:

X is x

R1:

If X is A1 then z = x
rules

R2:

If X is A2 then z = x + 3

(a) Antecedent fuzzy sets

(b) Consequent functions

1.2

A1

A2

Ai

2.5

0.8

0.6

1.5

0.4

0.2

0.5

f2

f1

0
0

0.5

1.5

2.5

0.5

1.5

2.5

Pedrycz and Gomide, FSE 2007

if x (0 ,1]
x

z = A1 ( x) x + A2 ( x)( x + 3) if x [1,2]
x + 3
if x [2 ,3)

(b) Output of the functional model

y

2
1.8
1.6
1.4
1.2

output

1
0.8
0.6
0.4
0.2
0
0

0.5

1.5

2.5

Pedrycz and Gomide, FSE 2007

Example 2
x [0, 3]

inputs

P:

X is x

R1:

If X is A1 then y = sin(2x)

R2:

If X is A2 then y = 0.5x

R3:

If X is A3 then y = sin(3x)

rules

output
(a) Antecedent fuzzy sets

(b) output of the func tional fuzzy model

1.2

1.5

A2

A1

A3

0.8

0.5

0.6

0.4

-0.5

0.2

-1

0
-5

-4

-3

-2

-1

4 x

-1.5
-5

-4

-3

-2

-1

4 x

Pedrycz and Gomide, FSE 2007

Example 2
x [0, 3]

inputs

P:

X is x

R1:

If X is A1 then y = 1

R2:

If X is A2 then y = x

R3:

If X is A3 then y = 1

rules

output
(a) Antecedent fuzzy sets

(c) output of the functional fuzzy model

1.2

1.5

A2

A1

A3

0.8

0.5

0.6

0.4

-0.5

0.2

-1

0
-5

-4

-3

-2

-1

4 x

-1.5
-5

-4

-3

-2

-1

Pedrycz and Gomide, FSE 2007

Gradual fuzzy models

Ri: The more X is Ai the more Z is Ci
i = 1,..., N
1 if Ci ( z ) Ai ( x)
Ri ( x, y ) =
0 otherwise
N

i =1

i =1

C = I (Ci ) i = I Ci

Pedrycz and Gomide, FSE 2007

Gradual fuzzy model architecture

A1
Poss

C1

Ai
x

Poss

C1

Ci

AN
Poss

C1

C
C1

Ci

Min

CN

C1

CN

Pedrycz and Gomide, FSE 2007

Example: gradual fuzzy model processing

A1

A2

C1 C2

2
x

C1

C2
z

Pedrycz and Gomide, FSE 2007

Example
inputs

P:

X is x

R1:

The more X is A1 the more Z is C1

x [0, 3]

rules
R2:

The more X is A1 the more Z is C1

output
4

A1

A2

Ai

0.8

3.5

0.6
0.4

0.2
0
1

1.5

2.5

3.5

2.5

C1

C2
2

Ci

0.8
0.6

1.5

0.4
0.2

0
1

1.5

2.5

3.5

1.5

2.5

3.5

Pedrycz and Gomide, FSE 2007

11.6 Approximation properties

of fuzzy rule-based models

Pedrycz and Gomide, FSE 2007

 FRBS uniformly approximates continuous functions

any degree of accuracy
closed and bounded sets

Universal approximation with (Wang & Mendel, 1992):

algebraic product t-norm in antecedent
rule semantics via algebraic product
rule aggregation via ordinary sum
Gaussian membership functions
sup-min compositional rule of inference
pointwise inputs
centroid defuzzification
Pedrycz and Gomide, FSE 2007

 Universal approximation when (Kosko, 1992):

min t-norm in antecedent
rule aggregation via ordinary sum
symmetric consequent membership functions
sup-min compositional rule of inference
pointwise inputs
centroid defuzzification

(additive models)

Pedrycz and Gomide, FSE 2007

 Universal approximation with (Castro, 1995):

arbitrary t-norm in antecedent
rule semantics: r-implications or conjunctions
triangular or trapezoidal membership functions
sup-min compositional rule of inference
pointwise inputs
centroid defuzzification

Pedrycz and Gomide, FSE 2007

11.7 Development of rule-based

systems

Pedrycz and Gomide, FSE 2007

Expert-based development
Knowledge provided by domain experts
basic concepts and variables
links between concepts and variables to form rules

Reflects existing knowledge

can be readily quantified
short development time

Pedrycz and Gomide, FSE 2007

Example: fuzzy control

Fuzzy
Controller

Process

Ri: If Error is Ai and Change of Error is Bi then Control is Ci

Ri: If e is Ai and de is Bi then u is Ci

Pedrycz and Gomide, FSE 2007

Ri: If e is Ai and de is Bi then u is Ci

y
r
e

t
Change of Error (de) / Error (e)

NM

NS

ZE

PS

PM

NB

PM

NB

NB

NB

NM

NM

PM

NB

NS

NM

NM

NS

PM

NS

NS

NM

PM

NS

NS

NM

PS

PM

PS

NS

NM

PM

PM

PM

PS

PM

NM

PB

PM

PM

PM

PM

NM
Pedrycz and Gomide, FSE 2007

Data-driven development
Given a finite set of input/output pairs
{(xk, yk), k = 1,..., M}
xk = [x1k, x2k,...., xnk] Rn
zk = [xk, yk] Rn+1, k = 1,..., M
Clustering zk = [xk, yk] Rn+1, k = 1,..., M (e.g. using FCM)
v1, v2,....,vN

prototypes/cluster centers

vi Rn+1, i = 1,..., N
Idea: fuzzy clusters fuzzy rules
Pedrycz and Gomide, FSE 2007

Example
R3

R2

v3

v2

R4

R1
v4

v1

Pedrycz and Gomide, FSE 2007

 Projecting the prototypes in the input and output spaces

v1[y], v2[y],....,vN [y] projections of prototypes in Y
v1[x], v2[x],....,vN [x] projections of prototypes in X
Ri: If X is Ai then Y is Ci, i = 1,..., N

Pedrycz and Gomide, FSE 2007

11.8 Parameter estimation for

functional rule-based
systems

Pedrycz and Gomide, FSE 2007

 Functional fuzzy rules

Ri: If Xi1 is Ai1 and ... and Xin is Ain then z = aio + ai1x1 + ....+ ainxn
i = 1,..., N
Given input/output data: {(x1, y1), (x2, y2),....,(xM, yM)}
Let ai = [aio, ai1, ai2,...., ain]T
Output of functional models
yk =

wik fi (x k ,ai ) ,

i =1

wik =

i ( xk )
N

i ( xk )

i =1

Output for linear consequents

yk =

Ta ,
z ik
i

i =1

T
z ik = [1, wik x T
k]

Pedrycz and Gomide, FSE 2007

Let
a1
a
a= 2
M
a
N

yk = z1Tk

zT
2k

a1
a
T
L z Nk 2
M
a
N

and
y1
y
y= 2
M
y
M

then

zT
11
T
z12
Z =
M
z T
1M

T
z12

zT
22
M
zT
2M

z TN1

T
L zN2

O
M
L z TNM
L

y = Za

Pedrycz and Gomide, FSE 2007

Global least squares approach

Mina JG(a) = || y Za||2
|| y Za||2 = (y Za)T (y Za)
Solution
aopt = Z# y
Z# = (ZT)1ZT

Pedrycz and Gomide, FSE 2007

Local least squares approach

N

Min a J L (a) = y Zi ai 2
i =1

zT
i1
T

z
Zi = i 2
M
T
z iM

Solution
aiopt = Zi# y
Zi# = (ZiT)1ZiT
Pedrycz and Gomide, FSE 2007

11.9 Design issues of FRBS:

Consistency and
completeness

Pedrycz and Gomide, FSE 2007

Given input/output data: {(x1, y1), (x2, y2),....,(xM, yM)}

consistency
completeness
accuracy

data

rules

Issue: quality of the rules

Pedrycz and Gomide, FSE 2007

Completeness of rules
All data points represented through some fuzzy set
maxi = 1,..., M Ai(xk) > 0 for all k = 1,2,..., M
Input space completely covered by fuzzy sets
maxi = 1,..., M Ai(xk) > for all k = 1,2,..., M

Pedrycz and Gomide, FSE 2007

Consistency of rules
Rules in conflict
similar or same conditions
completely different conclusions

Conditions and
Conclusions

Similar
Conclusions

Different
Conclusions

Similar Conditions

rules are redundant

rules are in
conflict

Different
Conditions

different rules;
could be eventually
merged

different rules

Pedrycz and Gomide, FSE 2007

Ri:

If X is Ai then Y is Bi

Rj:

If X is Aj then Y is Bj
M

cons(i , j ) = {| Bi ( yk ) B j ( yk ) | | Ai ( xk ) A j ( xk ) |}
i =1

Alternatively
M

cons(i , j ) = {Poss( Ai ( xk ) , A j ( xk )) Poss( Bi ( yk ) , B j ( yk ))}

i =1

is an implication induced by some t-norm (r-implication)

1 M
cons(i ) =
cons(i , j )
M j =1

Pedrycz and Gomide, FSE 2007

11.10 The curse of dimensionality

in rule-based systems

Pedrycz and Gomide, FSE 2007

 Curse of dimensionality
number of variables increase
exponential growth of the number of rules

Example
n variables
each granulated using p fuzzy sets
number of different rules = pn

Scalability challenges

Pedrycz and Gomide, FSE 2007

11.11 Development scheme of

fuzzy rule-based models

Pedrycz and Gomide, FSE 2007

 Spiral model of development

incremental design, implementation and testing
multidimensional space of fundamental characteristics

Stability

Interpretability

Accuracy

Knowledge
Representation

Pedrycz and Gomide, FSE 2007