Professional Documents
Culture Documents
Outline
Crisp Logic
Crisp logic is concerned with absolutes-true
or false, there is no in-between.
Example:
Rule:
If the temperature is higher than 80F, it is hot;
otherwise, it is not hot.
Cases:
Temperature = 100F Hot
Temperature = 80.1FHot
Not hot
Temperature = 79.9F
Not hot
Temperature = 50F
HOT
False
0
80F
Temperature
Fuzzy
Probability
Example #1
Billy has ten toes.
The probability Billy
has nine toes is
zero.
The fuzzy
membership of Billy
in the set of people
with
nine
toes,
however,
is
Example #2
#
1
#
2
Example #3
Fuzzy is said to measure possibility rather than
probability.
Difference
What is FUZZY
How is the weather today?
Sunny (more
20% Cloud ??
real)
close to
close to
FUZZY SETS
Classical set
Fuzzy set
0,1
[0,1]
Hard
YES
WHITE
Soft
BLACK
NO
Flexibility
with the
Concept
of
TALL
= 0.3 means
F
X
Domain =
F [X]
Range = F [X]
1.0
1.0
0.5
0.5
x
0.0
0.0
x
A concept
Not unique
Objective/subjective Estimation
and land
1.0
0.5
0.0
1.0
1.0
0.5
0.5
x
0.0
0.0
Natural Language
Consider:
Joe is tall
-- what is tall?
Joe is very tall -- what does this differ
from tall?
true
Fuzzy Logic
An approach to uncertainty that
Example: Young
Example:
Ann is 28,
Bob is 35,
Charlie is 23,
Young
Middle
Old
0.5
0
25
40
55
Age
A fuzzy set
More Definitions
Support
Core
Normality
Crossover points
Fuzzy singleton
-cut, strong -cut
Convexity
Fuzzy numbers
Bandwidth
Symmetricity
Open left or right,
closed
MF Terminology
MF
1
.5
Core
Crossover points
- cut
Support
Fuzzy Hedge
DILATION
CONCENTRATION
: Dilation
:
:
more or less
very
: Concentration.
1.0
More-or-less Tall
Very Tall
Tall
0.5
x
0.0
convexmf.m
Set-Theoretic Operations
Subset:
A B A B
Complement:
A X A A (x ) 1 A (x )
Union:
C A B c (x ) m ax(A (x ),B (x )) A (x ) B (x )
Intersection:
C A B c (x ) m in(A (x ),B (x )) A (x ) B (x )
Fuzzy Operations
Fuzzy intersection
Operation)
T- norms (AND
B
1
T- norm
0
A B
Fuzzy Operations
Fuzzy union
Operation)
T-conorms (OR
B
1
T- conorm
0
A B
Fuzzy Operations
Fuzzy Complement
Fuzzy complement
(NOT Operation)
p implies q p q
Semantics of implication:
If p is true then I am claiming that q is true. If p is false then
I make no claim.
E.g. If it rains then I will get wet; a person may be wet
otherwise, but if it rains, it is very likely that he will be wet.
Actions
(Crisp
world)
Controlled
Process
Defuzzificatio
n
Module
Fuzzy
inference
engine
Fuzzification
Module
Conditions
(Crisp
world)
Fuzzified output
variable(s) (Fuzzy
world) (as
decision)
Fuzzy Rule
Base
Fuzzified input
variables (Fuzzy
world) (as facts)
DEFINITIONS:
INPUT#1: ("Error", positive (P), zero (Z), negative (N))
INPUT#2: ("Error-dot", positive (P), zero (Z), negative
(N))
Output : Heat (H), No Change (-), Cool (C))
INPUT-1: System Status
Error = Command-Feedback
P=Too cold, Z=Just right, N=Too hot
INPUT-2: System Status
Error-dot = d(Error)/dt
P=Getting hotter Z=Not changing N=Getting colder
OUTPUT: Inference & System Response
Output H = Call for heating - = Don't change anything C
= Call for cooling
(e
(e
(e
(e
(e
<
=
>
<
=
0)
0)
0)
0)
0)
AND
AND
AND
AND
AND
(er
(er
(er
(er
(er
<
<
<
=
=
0)
0)
0)
0)
0)
then
then
then
then
then
(e
(e
(e
(e
>
<
=
>
0)
0)
0)
0)
AND
AND
AND
AND
(er
(er
(er
(er
=
>
>
>
0)
0)
0)
0)
then
then
then
then
INFERENCING
The last step completed in the example in the last
article was to determine the firing strength of each
rule. It turned out that rules 4, 5, 7, and 8 each
fired at 50% or 0.5 while rules 1, 2, 3, 6, and 9 did
not fire at all (0% or 0.0). The logical products for
each rule must be combined or inferred (maxmin'd, max-dot'd, averaged, root-sum-squared,
etc.) before being passed on to the defuzzification
process for crisp output generation. Several
inference methods exist.
The MAX-MIN method tests the magnitudes of each
rule and selects the highest one. The horizontal
coordinate of the "fuzzy centroid" of the area under
that function is taken as the output. This method
does not combine the effects of all applicable rules
but does produce a continuous output function and
is easy to implement.
1. If (e
2. If (e
3. If (e
4. If (e
5. If (e
0.50
6. If (e
0.25
7. If (e
8. If (e
0.50
9. If (e
0.25
<
=
>
<
=
0)
0)
0)
0)
0)
AND
AND
AND
AND
AND
(er
(er
(er
(er
(er
<
<
<
=
=
0)
0)
0)
0)
0)
then
then
then
then
then
Union :
Fuzzy union (): the union of two
E.g.
UNION :
TALL
1.0
0.8
0.6
HANDSOME
5.0
5.3 5.6
6.0
TALL HANDSOME
Generalization of
6.6
7.0
TALL or HANDSOME
AB max A x , B x x X
Intersection :
Fuzzy intersection (): the
E.g.
A B = {MIN(1.0, 0.2), MIN(0.20, 0.45),
MIN(0.75, 0.50)} = {0.2, 0.20, 0.50}
Intersection :
TALL
1.0
0.8
0.6
HANDSOME
5.0
5.3 5.6
6.0
TALL HANDSOME
Generalization of
6.6
7.0
AB x min A x , B x x X
Defuzzification
MA Model : Center of Gravity, Height method etc.
i ai
1
z n
i 1
TS Model :
Classifier model :
Class
= firing strength
k arg max i
i
i f x, y
z i 1 n
i
in
[Zadeh77]
Let Universe X = { 1, 2, 3, 4 }.
A little = {(1,1.0), (2,0.6), (3,0.2), (4,0.0)} in X.
B approximately equal in X Y
1
2
3
4
1
1.0
0.5
0.0
0.0
2
0.5
1.0
0.5
0.0
3
0.0
0.5
1.0
0.5
C(y) = A B
= max min {A(x), B(x,y)}
x
4
0.0
0.0
0.5
1.0
Architecture
reasoning used by a neural
The
Solution
Example: A Neuro-Fuzzy
Architecture with Feature
Selection Capability
Parameters to be Learned
Weights associated with the links
Evolutionary Algorithm
fuzzy fitness
fuzzy operators
1
Fuzzy Sistem
c2
c3
c4
input
input
output
rules
...
Rmax
A richer representation
Input
membership
functions
Output
MFs
Rules
IF x is A AND v is B THEN F is C
IF a is D THEN F is E
IF is G AND x is H THEN F is C
IF true THEN F is K
Initialization
Input variables
IF
Output variables
b C c
d
min a
no. domains = 2 + exponential(3)
Rules
is
AND
is
AND
is
AND
is
THEN
max
is
Recombination
A rule takes with it
all the referred domains
with their MFs
IF x is A AND v is B THEN F is C
something else
something else
IF true THEN F is K
something else
IF a is D THEN F is E
IF is G AND x is H THEN F is C
something else
IF x is A AND v is B THEN F is C
IF a is D THEN F is E
IF is G AND x is H THEN F is C
IF true THEN F is K
Mutation
{add, remove, change} domain to {input, output} variable;
{duplicate, remove} a rule;
change a rule:
{add, remove, change} a clause in the {antecedent,
consequent}
input MF perturbation:
Controlling the
Evolutionary Process
Motivation:
Features:
complex dynamics
non-binary conditions
intuitive knowledge available
Knowledge Acquisition
ALGORITHM
statistics
visualization
KNOWLEDGE
Fuzzfying Evolutionary
Algorithms
Population Statistics
Fuzzy Fitness
Faster calculation
Less precision
Specific Selection
Neuro-Fuzzy Systems
Fuzzy Neural Networks
fuzzy neurons (OR, AND, OR/AND)
learning algorithms (backpropagationstyle)
NEFPROX
ANFIS
Co-operative Neuro-Fuzzy Systems
Adaptive FAMs: differential competitive
learning
Self-Organizing Feature Maps
Fuzzy ART and Fuzzy ARTMAP
w11
w12
AND
wm1
v1
wm 2
OR
w1n
xn
wmn
AND
vm