Extension Principle Hand Out

Extension Principle
Adriano Cruz, adriano@nce.ufrj.br

PPGI-UFRJ
September 2011
Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 1 / 62
Summary
1 Introduction
2 Crisp Functions, Mappings and Relations
3 Functions of Fuzzy Sets
4 Fuzzy Arithmetic
5
Interval Analysis in Arithmetic
6 Approximate Methods of Extension
Vertex Method
DSW Algorithm
Section Summary
1 Introduction
4 Fuzzy Arithmetic
5
Vertex Method
DSW Algorithm
Would a precise model be a contradiction?
Bibliography
Kevin M. Passino, Stephen Yurkovich, Fuzzy Control in Chapter 5, Addison
Wesley Longman, Inc, USA, 1998.
Timothy J. Ross , Fuzzy Logic with Engineering Applications, John Wiley
and Sons, Inc, USA, 2010.
R. R. Yager, A characterization of the extension principle, Fuzzy Sets Syst.,
18, 205-217, 1986
John Yen, Reza Langari, Fuzzy Logic: Intelligence, Control and Information,
Prentice Hall, USA, 1999
L. Zadeh, The concept of a linguistic variable and its application to
approximate reasoning, Part I. Inf Sci., 8, 199-249, 1975
W. Dong and H. Shah, Vertex Method for computing functions of fuzzy
variables. Fuzzy Sets Syst., 24, 65-78, 1987.
W. Dong and H. Shah and F. Wong, Fuzzy computations in risk and decision
analysis, Civ. Eng. Syst., 2, 201-208, 1985.
Background
Consider a function y = f (x).
If we known x it is possible to determine y.
Is it possible to extend this mapping when the input, x, is a fuzzy
value.
The extension principle developed by Zadeh (1975) and later by Yager
(1986) establishes how to extend the domain of a function on a fuzzy
sets.
Section Summary
1 Introduction
4 Fuzzy Arithmetic
5
Vertex Method
DSW Algorithm
Crisp Mappings
X f(X) Y
Functions Applied to Intervals
An interval I is a crisp set, I X.
Compute the image of the interval, which is a crisp set in Y.
Presumably, sets in the power set of X can be mapped to the power
set of Y, that is f : P(X) P(Y).
The image B Y of a set A X can be calculated as B = f (A) or
for all x A, y = f (x)
B is dened by its characteristic value
B
(y) =
f (A)
(y) =
y=f (x)
A
(x)
Functions Applied to Intervals
x
y
I
f(I)
Functions Applied to Intervals - Example I
Consider the Universe X = {2, 1, 0, 1, 2}
Consider the set A = {0, 1}
Using the Zadeh notation A = {
0
2
+
0
1
+
1
0
+
1
1
+
0
2
}
Consider the mapping y = |4x| + 2
What is the resulting set B on the Universe Y = {2, 6, 10}
Functions Applied to Intervals - Example II
Using
B
(y) =
f (A)
(y) =
y=f (x)

A
(x)
and y = |4x| + 2.
B
(2) = {
A
(0)} = 1.
B
(6) = {
A
(1),
A
(1)} = {0, 1} = 1.
B
(10) = {
A
(2),
A
(2)} = {0, 0} = 0.
B = {
1
2
+
1
6
+
0
10
} or B = {2, 10}.
Using Relations
It is possible to achieve the results using a relation that express the
mapping y = |4x| + 2.
Lets X = {2, 1, 0, 1, 2}.
Lets Y = {0, 1, 2, . . . , 9, 10}
The relation
R =
0 1 2 3 4 5 6 7 8 9 10
2
1
0
1
2
0 0 0 0 0 0 0 0 0 0 1
0 0 0 0 0 0 1 0 0 0 0
0 0 1 0 0 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0 1
B = A R
A = {
0
2
+
0
1
+
1
0
+
1
1
+
0
2
} or more conveniently A = {0, 0, 1, 1, 0}
Applying the Relation
Using
B
(y) =
xX
(
A
(x)
R
(x, y))
we nd
B
(y) =
1, for y = 2, 6
0, otherwise
.
Or
B =
0
0
+
0
1
+
1
2
+
0
3
+
0
4
+
0
5
+
1
6
+
0
7
+
0
8
+
0
9
+
0
10

Section Summary
1 Introduction
4 Fuzzy Arithmetic
5
Vertex Method
DSW Algorithm
Fuzzy Mappings

Fuzzy
argument
?
Starting Point
Consider two universes of discourse X and Y and a function y = f (x).
Suppose that elements in universe X form a fuzzy set A.
What is the image (dened as B) of A on Y under the mapping f ?
Similarly to the crisp denition, B is obtained as
B
(y) =
f (A)
(y) =
y=f (x)
A
(x)
Simplifying the Notation
Fuzzy vector is a convenient shorthand for calculations that use
matrix relations.
Fuzzy vector is a vector containing only the fuzzy membership values.
Consider the fuzzy set:
B =
0
0
+
0.2
1
+
0.3
2
+
0.5
3
+
0.7
4
+
0.9
5
+
1
6
+
0
7
+
0
8
+
0
9
+
0
10
The fuzzy set B may be represented by the fuzzy vector b:

b =
0, 0.2, 0.3, 0.5, 0.7, 0.9, 1, 0, 0, 0, 0

Extension Principle
Suppose that f is a function from X to Y and A is a fuzzy set on X
dened as
A =
A
(x
1
)/x
1
+
A
(x
2
)/x
2
+ . . . +
A
(x
n
)/x
n
.
The extension principle states that the image of fuzzy set A under the
mapping f (.) can be expressed as a fuzzy set B dened as
B = f (A) =
A
(x
1
)/y
1
+
A
(x
2
)/y
2
+ . . . +
A
(x
n
)/y
n
where y
i
= f (x
i
)
Many-to-one mappings
If f (.) is a many-to-one mapping, then, for instance, there may exist
x
1
, x
2
X, x
1
= x
2
, such that f (x
1
) = f (x
2
) = y
, y
Y.
The membership degree at y = y is the maximum of the
membership degrees at x
1
and x
2
more generally, we have
B
(y
) = max
y=f (x
i
)
A
(x)
Monotonic Continuous Functions
For each point in the interval:
Compute the image of the interval.
The membership degrees are carried through.
x
y
A
B
(x)
B
(x)
A
Monotonic Continuous Functions Ex.
Function: y = f (x) = 0.6 x + 4.
Input: Fuzzy number - around-5.
around 5 = {
0.3
3
+
1.0
5
+
0.3
7
}.
f (around 5) = {
0.3
f (3)
+
1
f (5)
+
0.3
f (7)
}.
f (around 5) = {
0.3
0.63+4
+
1
0.65+4
+
0.3
0.67+4
}.
f (around 5) = {
0.3
5.8
+
1
7
+
0.3
8.2
}.
Monotonic Continuous Functions Ex.
x y

(
x
)
B
(x)
A
x
3 5 4 7 6 2 1
1
2
3
4
5
6
7
8
(x)
A
3 5 4 7 6
0.3
1.0
x
2 1
7
0
.
3
1
.
0
x
8
.
2
5
.
8
Non-Monotonic Continuous Functions Ex.
Function: y = f (x) = x
2
6 x + 11.
Input: Fuzzy number - around-4.
around 4 = {
0.3
2
+
0.6
3
+
1
4
+
0.6
5
+
0.3
6
}.
f (around 4) = {
0.3
f (2)
+
0.6
f (3)
+
1
f (4)
+
0.6
f (5)
+
0.3
f (6)
}.
f (around 4) = {
0.3
3
+
0.6
2
+
1
3
+
0.6
6
+
0.3
11
}.
f (around 4) = {
0.31
3
+
0.6
2
+
0.6
6
+
0.3
11
}.
f (around 4) = {
0.6
2
+
1
3
+
0.6
6
+
0.3
11
}.
Generalizing
Suppose the input universe is composed of the Cartesian product of
many universes.
The mapping f is dened on the power set of this universe as
f : P(X
1
X
2
X
n
) P(Y).
Let the fuzzy sets A
1
, A
2
, . . . , A
n
be dened on X
1
, X
2
, . . . , X
n
then B = f (A
1
, A
2
, . . . , A
n
).
The membership function of B is dened as
B
(y) = max
y=f (x
1
,x
2
,...,x
n
)
{min [
A
1
(x
1
),
A
2
(x
2
), . . . ,
A
n
(x
n
)]}
This equation is usually called the Zadehs extension principle.
If the function f is a continous-valued expression, the max operator is
replaced by the sup (supremum) which is the least upper bound.
Example
Inputs: A = {
0.2
1
+
1
2
+
0.7
4
} and B = {
0.5
1
+
1
2
}
Output: f (A, B) = A B (arithmetic product).
A B =
min(0.2, 0.5)
1
+
max[min(0.2, 1), min(0.5, 1)]
2
+
max[min(0.7, 0.5), min(1, 1)]
4
+
min(0.7, 1)
8
0.2
1
+
0.5
2
+
1
4
+
0.7
8

Fuzzy Transform
Fuzzy transform happens when the input of a single element
(nonfuzzy) maps to a fuzzy set in the output universe.
An element x in universe X is mapped to a fuzzy set B in universe Y.
B = f (x), where f is a fuzzy mapping.
If X and Y are nite f can be expressed as a fuzzy relation R or
R =
y
1
y
2
. . . y
j
. . . y
m
x
1
x
2
.
.
.
x
i
.
.
.
x
n
r
11
r
12
. . . r
1j
. . . r
1m
r
21
r
22
. . . r
2j
. . . r
2m
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
r
i 1
r
i 2
. . . r
ij
. . . r
im
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
r
n1
r
n2
. . . r
nj
. . . r
nm

Fuzzy Transform Singleton
For a particular singleton x
i
its fuzzy image is the fuzzy set B
i
= f (x
i
)
B
i
(y
j
) = r
ij
or in fuzzy vector notation
b
i
= {r
i 1
, r
i 2
, . . . , r
im
}.
Fuzzy Transform Generalized
For a particular fuzzy input set A its fuzzy image is B = f (A)
B
(y) =
xX
(
A
(x)
R
(x, y))
b = a R.
b
j
= max
i
(min(a
i
, r
ij
))
Section Summary
1 Introduction
4 Fuzzy Arithmetic
5
Vertex Method
DSW Algorithm
Fuzzy Numbers
A fuzzy number is fuzzy subset of the universe of a numerical number.
A fuzzy real number is a fuzzy subset of the domain of real numbers.
A fuzzy integer number is a fuzzy subset of the domain of integers.
Examples of Fuzzy Numbers
1 2 3 4 5 6 7 8 9 10
1.0
( x)
x
1 2 3 4 5 6 7 8 9 10
1.0
( x)
x
Fuzzy Real Number 5
Fuzzy Integer Number 5
Fuzzy Arithmetic
Applying the extension principle to arithmetic operations it is possible
to dene fuzzy arithmetic operations
Let x and y be the operands, z the result.
Let A, B and C denote the fuzzy sets that represent the operands x,
y and z respectively.
Fuzzy Arithmetic
Using the extension principle a fuzzy arithmetic operation denoted by
{+, , , } is dened as
C
(z) = max
z=xy
{min [
A
(x),
B
(y)]}
Example of Problem
We will calculate the product of two fuzzy sets dened as:
X =
0
1
+
0.33
2
+
0.66
3
+
1
4
+
0.66
5
+
0.33
6
+
0
7
Y =
0
2
+
0.33
3
+
0.66
4
+
1
5
+
0.66
6
+
0.33
7
+
0
8
The result would be:

X Y =
0
2
+
0
3
+
0
4
+
0
5
+
0.33
6
+
0.33
8
+
0.33
9
+
0.33
10
+
0.66
12
+
0.33
14
+
0.66
15
+
0.33
16
+
0.66
18
+
1
20
+
0.33
21
+
0.66
24
+
0.66
25
+
0.33
28
+
0.66
30
+
0
32
+
0.33
35
+
0.33
36
+
0
40
+
0.33
42
+
0
48
+
0
49
+
0
56

Example of Problem
0 1 2 3 4 5 6 7 8 9
0
0.5
1
X
(
X
)
0 1 2 3 4 5 6 7 8 9
0
0.5
1
Y
(
Y
)
0 10 20 30 40 50 60
0
0.5
1
X Y
(
X

Y
)
Section Summary
1 Introduction
4 Fuzzy Arithmetic
5
Vertex Method
DSW Algorithm
Denitions I
Let I
1
and I
2
two interval numbers dened ordered pair of real
numbers with lower and upper bounds.
I
1
= [a, b] where a b and I
2
= [c, d] where c d.
I
1
I
2
= [a, b] [c, d] where {+, , , } is another interval.
When adding or multiplying two intervals we are performing these
operations on the innite number of combinations of pairs from each
of the two intervals.
Denitions II
[a, b] + [c, d] =[a + c, b + d]
[a, b] [c, d] =[a d, b c]
[a, b] [c, d] =[min(ac, ad, bc, bd), max(ac, ad, bc, bd)]
[a, b] [c, d] =[a, b]
1
d
,
1
c
since 0 / [c, d]
Conclusions
When adding or multiplying two intervals we are performing these
operations on the innite number of combinations of pairs from each
of the two intervals.
We only need to nd the endpoints of the intervals to nd the
endpoints of the solutions.
Section Summary
1 Introduction
4 Fuzzy Arithmetic
5
Vertex Method
DSW Algorithm
Vertex Method
The method is based on a combination of the -cut and standard
interval analysis [Dong and Shah, 1987].
The algorithm is easy to implement and can be computationally
ecient.
1
a b x
0
A

Vertex Algorithm
Any continuous membership function can be represented by a
continuous sweep of -cut intervals from = 0
+
to = 1.
Let y = f (x) be extended for fuzzy sets, or B = f (A).
A will be decomposed into a series for -cut intervals.
When f (x) is continuous and monotonic on I
= [a, b] the interval

representing B at a particular value of (B
) is
B
= f (I
) = [min(f (a), f (b)), max(f (a), f (b))]

Vertex Algorithm for n-inputs
Let y = f (x
1
, x
2
, . . . , x
n
).
The input space is represented by n-dimensional Cartesian region.
N = 2
n
is the number of vertices of the region.
Each of the input variables is described by an interval I
i
at a specic
-cut where I
i
= [a
i
, b
i
], i = 1, 2, . . . , n.
B
=f (I
1
, I
2
, . . . , I
n
) (1)
B
min
j
(f (c
j
)), max
j
(f (c
j
))
, j = 1, 2, . . . , N (2)
where c
j
is the coordinate of the jth vertex representing the
n-dimensional Cartesian region.
Vertex Algorithm for n-inputs
The method is accurate only when the conditions of continuity and
no extreme points are satised.
An extreme point is a point of maximum or minimum.
Extreme points should be treated as additional vertices E
k
.
B
min
j ,k
(f (c
j
), f (E
k
)), max
j ,k
(f (c
j
), f (E
k
))
,
j = 1, 2, . . . , N and k = 1, 2, . . . , m
Example of Problem
We will use Vertex Method to determine the output of the function
y = x(2 x) to an input fuzzy set A = (x).
We will use the three -cuts: = 0
+
, 0.5, 1.0
The corresponding intervals are: I
0
+ = [0.5, 2], I
0.5
= [0.75, 1.5],
I
1
= [1, 1].
The extreme point x = 1, y = 1 can be calculated by derivatives.
0 0.5 1 1.5 2 2.5
0
0.5
1
y=f(x)
x
y
0 0.5 1 1.5 2 2.5
0
0.5
1
A
x
(
x
)
0.75
Calculating
I
0
+ = [0.5, 2] c
1
= 0.5, c
2
= 2, E
1
= 1
f (c
1
) = 0.75, f (c
2
) = 0, f (E
1
) = 1
B
0
+ = [min(0.75, 0, 1), max(0.75, 0, 1)] = [0, 1]
I
0.5
= [0.75, 1.5] c
1
= 0.75, c
2
= 1.5, E
1
= 1
f (c
1
) = 0.9375, f (c
2
) = 0.75, f (E
1
) = 1
B
0.5
= [min(0.9375, 0.75, 1), max(0.9375, 0.75, 1)] = [0.75, 1]
I
1
= [1, 1] c
1
= 1, c
2
= 1, E
1
= 1
f (c
1
) = f (c
2
) = f (E
1
) = 1
B
1
= [min(1, 1, 1), max(1, 1, 1)] = [1, 1]
Results
0 0.5 1 1.5 2 2.5
0
0.5
1
y=f(x)
x
y
0 0.5 1 1.5 2 2.5
0
0.5
1
A
x
y
=
(
x
)
0.75
0 0.5 1 1.5 2 2.5
0
0.5
1
B
y
(
y
)
Another Example of Problem
We will use Vertex Method to calculate the product of two fuzzy sets
dened as:
X =
0
1
+
0.33
2
+
0.66
3
+
1
4
+
0.66
5
+
0.33
6
+
0
7
Y =
0
2
+
0.33
3
+
0.66
4
+
1
5
+
0.66
6
+
0.33
7
+
0
8

Interval I
0
+
Support for X is the interval [1, 7].
Support for Y is the interval [2, 8].
x y f()
1 2 f(a)=2
1 8 f(b)=8
7 2 f(c)=14
7 8 f(d)=56
min=2, max=56 and B
0
+ = [2, 56]
Interval I
0.33
x y f()
2 3 f(a)=6
2 7 f(b)=14
6 3 f(c)=18
6 7 f(d)=42
min=6, max=42 and B
0.33
= [6, 42]
Interval I
0.66
x y f()
3 4 f(a)=12
3 6 f(b)=18
5 4 f(c)=20
5 6 f(d)=30
min=12, max=30 and B
0.66
= [12, 30]
Interval I
1.0
x y f()
4 5 f(a)=20
min=20, max=20 and B
1.0
= [20, 20]
Vertex Method
1
10
XxY
0
A
20 30 40 50 60
0.66
0.33
DSW Algorithm
It uses -cut and standard interval analysis [Dong, Shah and Wong,
1985].
The algorithm:
Repeat for dierent values of where 0 1:
Find the interval(s) in the input membership function(s) that
correspond to this ;
Using standard binary interval operations, compute the interval for the
output membership function for the selected ;
Example of Problem
We will use DSW Method to determine the output of the function
y = x(2 + x) to an input fuzzy set A = (x).
We will use the three -cuts: = 0
+
, 0.5, 1.0
The corresponding intervals are: I
0
+ = [0.5, 2], I
0.5
= [0.75, 1.5],
I
1
= [1, 1].
0 0.5 1 1.5 2 2.5
0
2
4
6
8
y=f(x)
x
y
0 0.5 1 1.5 2 2.5
0
0.5
1
A
x
(
x
)
0.75
Calculating
I
0
+ = [0.5, 2]
B
0
+ = 2 [0.2, 2] + [0.5
2
, 2
2
] = [1, 4] + [0.25, 4] = [1.25, 8]
I
0.5
= [0.75, 1.5]
B
0.5
= 2 [0.75, 1.5] + [0.75
2
, 1.5
2
] = [1.5, 3] + [0.5625, 2.25] =
[2.0625, 5.25]
I
1
= [1, 1]
B
1
= 2 [1, 1] + [1
2
, 1
2
] = [2, 2] + [1, 1] = [3, 3] = 3
Results
0 0.5 1 1.5 2 2.5
0
5
y=f(x)
x
y
0 0.5 1 1.5 2 2.5
0
0.5
1
A
x
(
x
)
0.75
0 1 2 3 4 5 6 7 8 9
0
0.5
1
B
y
(
y
)
Another Example of Problem
We will use DSW Method to calculate the product of two fuzzy sets
dened as:
X =
0
1
+
0.33
2
+
0.66
3
+
1
4
+
0.66
5
+
0.33
6
+
0
7
Y =
0
2
+
0.33
3
+
0.66
4
+
1
5
+
0.66
6
+
0.33
7
+
0
8

Interval Arithmetic
I
0
+ : [1, 7] [2, 8] = [min(2, 14, 8, 56), max(2, 14, 8, 56)] = [2, 56].
I
0.33
: [2, 6] [3, 7] = [min(6, 18, 14, 42), max(6, 18, 14, 42)] = [6, 42].
I
0.66
: [3, 5] [4, 6] = [min(12, 20, 18, 30), max(12, 20, 18, 30)] =
[12, 30].
I
1
: [4, 4] [5, 5] = [min(20, 20, 20, 20), max(20, 20, 20, 20)] = [20, 20].
DSW Algorithm
1
10
XxY
0
A
20 30 40 50 60
0.66
0.33
The End

Extension Principle Hand Out

Cargado por

Información del documento

Derechos de autor

Formatos disponibles

Compartir este documento

Compartir o incrustar documentos

Opciones para compartir

¿Le pareció útil este documento?

¿Este contenido es inapropiado?

Copyright:

Formatos disponibles

Extension Principle Hand Out

Cargado por

Copyright:

Formatos disponibles

Extension Principle

Adriano Cruz, adriano@nce.ufrj.br

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 14 / 62

The fuzzy set B may be represented by the fuzzy vector b:

0, 0.2, 0.3, 0.5, 0.7, 0.9, 1, 0, 0, 0, 0

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 18 / 62

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 26 / 62

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 27 / 62

The result would be:

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 35 / 62

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 42 / 62

= [a, b] the interval

) = [min(f (a), f (b)), max(f (a), f (b))]

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 49 / 62

Adriano Cruz, adriano@nce.ufrj.br (PPGI-UFRJ) Extension Principle September 2011 59 / 62

También podría gustarte