Vous êtes sur la page 1sur 42

Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Slides for Fuzzy Sets, Ch. 2 of


Neuro-Fuzzy and Soft Computing

J.-S. Roger Jang (張智星)


CS Dept., Tsing Hua Univ., Taiwan
http://www.cs.nthu.edu.tw/~jang
jang@cs.nthu.edu.tw
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Lofti Zadeh : The Father of Fuzzy Logic

2
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Logic Applications


Automatic control of dam gates for hydroelectric-powerplants
(Tokio Electric Pow.)
Simplified control of robots
(Hirota, Fuji Electric, Toshiba, Omron)
Camera aiming for the telecast of sporting events
(Omron)
Substitution of an expert for the assessment of stock exchange
activities
(Yamaichi, Hitachi)
Preventing unwanted temperature fluctuations in air-conditioning
systems
(Mitsubishi, Sharp)
Compensation against vibrations in camcorders
(Matsushita)
Single button control for washing-machines
(Matsushita, Hitatchi)
Recognition of handwriting, objects, voice
(CSK, Hitachi, Hosai Univ., Ricoh)
3
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Logic Applications


Flight aid for helicopters
(Sugeno)
Simulation for legal proceedings
(Meihi Gakuin Univ, Nagoy Univ.)
Software-design for industrial processes
(Aptronix, Harima, Ishikawajima-OC Engeneering)
Controlling of machinery speed and temperature for steel-
works
(Kawasaki Steel, New-Nippon Steel, NKK)
Controlling of subway systems in order to improve driving
comfort, precision of halting and power economy
(Hitachi)
Improved fuel-consumption for automobiles
(NOK, Nippon Denki Tools)
Improved sensitiveness and efficiency for elevator control
(Fujitec, Hitachi, Toshiba)
Improved savety for nuklear reactors
4 (Hitachi, Bernard, Nuclear Fuel div.)
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Logic Applications


Efficient and stable control of car-engines
(Nissan)
Cruise-control for automobiles
(Nissan, Subaru)
Improved efficiency and optimized function of industrial
control applications
(Aptronix, Omron, Meiden, Sha, Micom, Mitsubishi,
Nisshin-Denki, Oku-Electronics)
Positioning of wafer-steppers in the production of
semiconductors
(Canon)
Optimized planning of bus time-tables
(Toshiba, Nippon-System, Keihan-Express)
Archiving system for documents
(Mitsubishi Elec.)
5
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Logic Applications


Prediction system for early recognition of earthquakes
(Inst. of Seismology Bureau of Metrology, Japan)
Medicine technology: cancer diagnosis
(Kawasaki Medical School)
Combination of Fuzzy Logic and Neural Nets
(Matsushita)
Recognition of handwritten symbols with pocket
computers
(Sony)
Recognition of motives in pictures with video cameras
(Canon, Minolta)
Automatic motor-control for vacuum cleaners with
recognition of surface condition and degree of soiling
(Matsushita)
Back light control for camcorders
(Sanyo)
6
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets: Outline


Introduction
Basic definitions and terminology
Set-theoretic operations
MF formulation and parameterization
• MFs of one and two dimensions
• Derivatives of parameterized MFs
More on fuzzy union, intersection, and complement
• Fuzzy complement
• Fuzzy intersection and union
• Parameterized T-norm and T-conorm

7
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Definition
Experts rely on common sense when they solve problems.

How can we represent expert knowledge that uses vague and


ambiguous terms in a computer?

Fuzzy logic is not logic that is fuzzy, but logic that is used to
describe fuzziness. Fuzzy logic is the theory of fuzzy sets,
sets that calibrate vagueness.

Fuzzy logic is based on the idea that all things admit of


degrees. Temperature, height, speed, distance, beauty – all
come on a sliding scale.
• The motor is running really hot.
• Tom is a very tall guy.
8
06th October Bogdan L. Vrusias 8
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

More Definitions
Fuzzy logic is a set of mathematical principles for knowledge
representation based on degrees of membership.

Unlike two-valued Boolean logic, fuzzy logic is multi-valued. It


deals with degrees of membership and degrees of truth.

Fuzzy logic uses the continuum of logical values between 0


(completely false) and 1 (completely true). Instead of just
black and white, it employs the spectrum of colours, accepting
that things can be partly true and partly false at the same time.

0 0 0 1 1 1 0 0 0.2 0.4 0.6 0.8 1 1


(a) Boolean Logic. (b) Multi-valued Logic.

9
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets
The concept of a set is fundamental to
mathematics.

However, our own language is also the


supreme expression of sets. For example, car
indicates the set of cars. When we say a car,
we mean one out of the set of cars.

The classical example in fuzzy sets is tall men.


The elements of the fuzzy set “tall men” are all
men, but their degrees of membership depend
10 on their height. (see table on next page)
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets
Degree of Membership
Name Height, cm
Crisp Fuzzy
Chris 208 1 1.00
Mark 205 1 1.00
John 198 1 0.98
Tom 181 1 0.82
David 179 0 0.78
Mike 172 0 0.24
Bob 167 0 0.15
Steven 158 0 0.06
Bill 155 0 0.01
Peter 152 0 0.00
11
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Crisp Vs Fuzzy Sets


Degree of
The x-axis represents the Membership
Crisp Sets
universe of discourse – the 1.0

range of all possible values 0.8


Tall Men
applicable to a chosen 0.6

variable. In our case, the 0.4

variable is the man height. 0.2


According to this 0.0
150 160 170 180 190 200 210
representation, the universe Height, cm
of men’s heights consists of Degree of
Membership Fuzzy Sets
all tall men. 1.0

0.8
The y-axis represents the
0.6
membership value of the
0.4
fuzzy set. In our case, the
fuzzy set of “tall men” maps 0.2
0.0
height values into 150 160 170 180 190 200 210
corresponding membership Height, cm
value
12
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

A Fuzzy Set has Fuzzy Boundaries


Let X be the universe of discourse and its
elements be denoted as x. In the classical set
theory, crisp set A of X is defined as function
fA(x) called the characteristic function of A:

1, if x  A
fA(x) : X  {0, 1}, where f A ( x)  
0, if x  A

This set maps universe X to a set of two


elements. For any element x of universe X,
characteristic function fA(x) is equal to 1 if x is
an element of set A, and is equal to 0 if x is not
13 an element of A.
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

A Fuzzy Set has Fuzzy Boundaries


In the fuzzy theory, fuzzy set A of universe X is defined by function
µA(x) called the membership function of set A

µA(x) : X  {0, 1}, where µA(x) = 1 if x is totally in A;


µA(x) = 0 if x is not in A;
0 < µA(x) < 1 if x is partly in A.

This set allows a continuum of possible choices. For any element x


of universe X, membership function µA(x) equals the degree to
which x is an element of set A. This degree, a value between 0 and
1, represents the degree of membership, also called membership
value, of element x in set A.

14
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets
Sets with fuzzy boundaries

A = Set of tall people

Crisp set A Fuzzy set A


1.0 1.0
.9
.5 Membership
function

5’10’’ Heights 5’10’’ 6’2’’ Heights

15
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Membership Functions (MFs)


Characteristics of MFs:
• Subjective measures
• Not probability functions

MFs “tall” in Asia

.8
.5 “tall” in the US

“tall” in NBA
.1
5’10’’ Heights

16
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets
Formal definition:
A fuzzy set A in X is expressed as a set of ordered
pairs:

A  {( x ,  A ( x ))| x  X }

Membership Universe or
Fuzzy set
function universe of discourse
(MF)

A fuzzy set is totally characterized by a


membership function (MF).

17
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets with Discrete Universes


Fuzzy set C = “desirable city to live in”
X = {SF, Boston, LA} (discrete and nonordered)
C = {(SF, 0.9), (Boston, 0.8), (LA, 0.6)}
Fuzzy set A = “sensible number of children”
X = {0, 1, 2, 3, 4, 5, 6} (discrete universe)
A = {(0, .1), (1, .3), (2, .7), (3, 1), (4, .6), (5, .2), (6, .1)}

18
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Sets with Cont. Universes


Fuzzy set B = “about 50 years old”
X = Set of positive real numbers (continuous)
B = {(x, B(x)) | x in X}

1
B(x) 
 x  50 
2

1  
 10 

19
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Alternative Notation
A fuzzy set A can be alternatively denoted as
follows:

X is discrete
A 
xi X
A ( xi ) / xi

X is continuous A    A( x) / x
X

Note that S and integral signs stand for the union of


membership grades; “/” stands for a marker and does
not imply division.

20
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Set Representation


Degree of
Membership Crisp Sets
1.0
0.8 Short Average Short
Tall
Tall Men
0.6
0.4
0.2
0.0
150 160 170 180 190 200 210
Height, cm
Degree of Fuzzy Sets
Membership
1.0
0.8
0.6 Short Average Tall

0.4
0.2 Tall

0.0
150 160 170 180 190 200 210
21
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Partition
Fuzzy partitions formed by the linguistic values
“young”, “middle aged”, and “old”:

lingmf.m
22
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

More Definitions
Support Convexity
Core Fuzzy numbers
Normality Bandwidth
Crossover points Symmetricity
Open left or right, closed
Fuzzy singleton
a-cut, strong a-cut

23
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

MF Terminology

MF

.5

a
0
Core X

Crossover points

a - cut
Support

24
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Convexity of Fuzzy Sets


A fuzzy set A is convex if for any l in [0, 1],
A ( lx1  ( 1  l ) x 2 )  min( A ( x1 ), A ( x 2 ))

Alternatively, A is convex is all its a-cuts are


convex.

convexmf.m
25
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Set-Theoretic Operations
Subset:
A  B  A  B
Complement:
A  X  A  A ( x )  1   A ( x )
Union:
C  A  B  c ( x )  max( A ( x ), B ( x ))  A ( x ) B ( x )
Intersection:
C  A  B  c ( x )  min( A ( x ), B ( x ))  A ( x ) B ( x )

26
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Set-Theoretic Operations

subset.m

27 fuzsetop.m
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

MF Formulation
 x a c  x 
Triangular MF: trimf ( x ; a, b , c )  max min ,  , 0
  b  a c  b 

 x a d  x 
Trapezoidal MF: trapmf ( x ; a, b , c , d )  max min , 1,  , 0
 b a d c 

2
1  x c 
  
2  
Gaussian MF: gaussmf ( x ; a, b , c )  e

1
Generalized bell MF: gbellmf ( x ; a, b , c )  2b
x c
1
b

28
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

MF Formulation

disp_mf.m
29
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

MF Formulation
1
Sigmoidal MF: sigmf ( x ; a, b , c ) 
1  e a( x  c )

Extensions:

Abs. difference
of two sig. MF

Product
of two sig. MF

disp_sig.m
30
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

MF Formulation
 c  x
L-R MF:  F L  a  , x  c

L R ( x ; c ,a ,  )  
 F  x  c  , x  c
   
R

Example: FL ( x )  max( 0, 1  x 2 )
3
F R ( x )  exp(  x )

c=65 c=25
a=60 a=10
b=10 b=40

31
difflr.m
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Cylindrical Extension

Base set A Cylindrical Ext. of A

cyl_ext.m

32
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

2D MF Projection
Two-dimensional Projection Projection
MF onto X onto Y

 R ( x, y )  A( x)  B( y) 
project.m max  R ( x , y ) max  R ( x, y )
y x
33
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

2D MFs

2dmf.m
34
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Complement
General requirements:
• Boundary: N(0)=1 and N(1) = 0
• Monotonicity: N(a) > N(b) if a < b
• Involution: N(N(a) )= a
Two types of fuzzy complements:
• Sugeno’s complement:
1 a
N s (a ) 
1  sa
• Yager’s complement:
N w ( a )  (1  a w )1/ w
35
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Complement
Sugeno’s complement: Yager’s complement:
1 a
N s (a )  N w ( a )  (1  a w )1/ w
1  sa

36 negation.m
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Intersection: T-norm


Basic requirements:
• Boundary: T(0, 0) = 0, T(a, 1) = T(1, a) = a
• Monotonicity: T(a, b) < T(c, d) if a < c and b < d
• Commutativity: T(a, b) = T(b, a)
• Associativity: T(a, T(b, c)) = T(T(a, b), c)
Four examples (page 37):
• Minimum: Tm(a, b)
• Algebraic product: Ta(a, b)
• Bounded product: Tb(a, b)
• Drastic product: Td(a, b)

37
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

T-norm Operator
Algebraic Bounded Drastic
Minimum: product: product: product:
Tm(a, b) Ta(a, b) Tb(a, b) Td(a, b)

38
tnorm.m
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Fuzzy Union: T-conorm or S-norm


Basic requirements:
• Boundary: S(1, 1) = 1, S(a, 0) = S(0, a) = a
• Monotonicity: S(a, b) < S(c, d) if a < c and b < d
• Commutativity: S(a, b) = S(b, a)
• Associativity: S(a, S(b, c)) = S(S(a, b), c)
Four examples (page 38):
• Maximum: Sm(a, b)
• Algebraic sum: Sa(a, b)
• Bounded sum: Sb(a, b)
• Drastic sum: Sd(a, b)

39
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

T-conorm or S-norm
Algebraic Bounded Drastic
Maximum: sum: sum: sum:
Sm(a, b) Sa(a, b) Sb(a, b) Sd(a, b)

40
tconorm.m
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Generalized DeMorgan’s Law


T-norms and T-conorms are duals which
support the generalization of DeMorgan’s law:
• T(a, b) = N(S(N(a), N(b)))
• S(a, b) = N(T(N(a), N(b)))

Tm(a, b) Sm(a, b)
Ta(a, b) Sa(a, b)
Tb(a, b) Sb(a, b)
Td(a, b) Sd(a, b)

41
Neuro-Fuzzy and Soft Computing: Fuzzy Sets

Parameterized T-norm and S-norm


Parameterized T-norms and dual T-conorms
have been proposed by several researchers:
• Yager
• Schweizer and Sklar
• Dubois and Prade
• Hamacher
• Frank
• Sugeno
• Dombi

42

Vous aimerez peut-être aussi