Fuzzy Logic

Outline

traditional logic: {true, false}

Crisp Logic vs. Fuzzy Logic

Fuzzy Logic Applications
Conclusion

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

Membership function of crisp

logic
True
1

HOT

False
0
80F

Temperature

If temperature >= 80F, it is hot (1 or true);

If temperature < 80F, it is not hot (0 or false).

Drawbacks of crisp logic

The membership function of crisp
logic fails

to distinguish between the members

of the same set and also
To detect the little difference among
the members of different sets

 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

A bottle of liquid has a

probability of of being rat
poison and of being pure
water.
A second bottles contents, in
the fuzzy set of liquids
containing lots of rat poison, is
.
The meaning of for the two
bottles
clearly
differs
significantly and would impact
your choice should you be
dying of thirst.

#
2

Example #3
Fuzzy is said to measure possibility rather than
probability.
Difference

All things possible are not probable.

All things probable are possible.
Contrapositive

All things impossible are improbable

Not all things improbable are impossible

What is FUZZY
How is the weather today?
Sunny (more
20% Cloud ??
real)

When did you come to the seminar?

At about 10 AM
(imprecision)

How do you teach driving to your

friend?

Linguistic imprecision, vagueness

What is FUZZY (contd)

What is the height of your friend?
5 5 ??
Close to 5 6
Medium
It is beyond that:

Subject to Precision of the

measuring Instrument
5 8.2
5 8.2

close to

TALL Person/ HEAVY guy Gradual

transition

What is FUZZY (contd)

What is the height of your friend?
5 5 ??
Close to 5 6
Medium
It is beyond that:

Subject to Precision of the

measuring Instrument
5 8.2
5 8.2

close to

TALL Person/ HEAVY guy Gradual

transition

FUZZY SETS
Classical set
Fuzzy set

0,1
[0,1]

Hard

YES
WHITE

Soft

A = {(A(x),x) : for all x X}

BLACK
NO

A(x) : degree of belonging of x to A or degree of

possessing some imprecise property represented by A
Example : tall man, long street, large number, sharp
corner, very young, etc.

Fuzzy set is a Generalization of classical set theory

Greater flexibility in capturing faithfully various
aspects of incompleteness or imperfection in a situation.

Flexibility

of fuzzy set theory is associated

with the

Concept

of

: A measure of compatibility of an object

with the concept represented by fuzzy set.

TALL

= 0.3 means

Compatibility of some one with the set ``TALL

NOT the probability that some one is TALL

i.e., 0.3 is the extent to which the concept ``TALL

must be stretched to fit him
As Amount of Stretching Concept

FUZZINESS IS ANALOGOUS TO ELASTICITY

F
X

Domain =

F [X]

Range = F [X]

Fuzzy sets are membership functions.

Representation of Fuzzy Sets

Membership functions

S Representation of Fuzzy Sets Membership functions

Representation of Fuzzy Sets Membership functions

S Representation of Fuzzy Sets

Membership functions

1.0

1.0

0.5

0.5

x
0.0

0.0
x

A concept

Grouping of painters and singers

Not unique

Classification of satellite images, say water

Objective/subjective Estimation

and land

Representation of Fuzzy Sets Membership

functions

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?

Natural language (like most other

activities in life and indeed the

universe) is not easily translated into
the absolute terms of 0 and 1.
false

true

Fuzzy Logic
An approach to uncertainty that

combines real values [01] and logic

operations

Fuzzy logic is based on the ideas of

fuzzy set theory and fuzzy set
membership often found in natural
(e.g., spoken) language.

Example: Young
Example:
Ann is 28,
Bob is 35,
Charlie is 23,

0.8 in set Young

0.1 in set Young
1.0 in set Young

Unlike statistics and probabilities, the

degree is not describing probabilities

that the item is in the set, but
instead describes to what extent the
item is the set.

Membership function of fuzzy

logic
Fuzzy values
Degree of
Membership

Young

Middle

Old

0.5
0

25

40

55

Age

Fuzzy values have associated degrees of membership in the set.

Crisp set vs. Fuzzy set

A traditional crisp set

A fuzzy set

Crisp set vs. Fuzzy set

HOW FUZZY IS A FUZZY SET

Membership values determine how much fuzziness a

fuzzy set A contains.

Quantification of amount of imprecision captured depends

on the extent to which the supporting objects (individually
or in a group) do or do not possess the imprecise property
conveyed by A.

Higher the extent, lower the fuzziness.

Fuzzy Logic enables us to

(1) To model the human
reasoning
process at a higher level.
(2) Can act as a tool for finding
solutions to problems.

Why Fuzzy Logic?

(1)Many decision making and problem

solving tasks are too complex to be

defined precisely.
(2)Imprecise knowledge.
(3)Fuzzy logic resembles human
reasoning in its use of approximate
information & uncertainty to generate
decisions.
(4) Adaptive

Advantage of fuzzy logic over

crisp logic
You want the value to switch

gradually as Young becomes Middle

and Middle becomes Old. This is the
idea of fuzzy logic.

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

Convexity of Fuzzy Sets

A fuzzy set A is convex if for any
in [0, 1],

A (x1 (1 )x 2 ) m in(A (x1 ),A (x 2 ))

Alternatively, A is convex if all its -cuts are convex.

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)

-Cut and strong -cut:

-Cut (strong -cut) of a fuzzy set A is the crisp set A (or
the crisp set +A ) that contains all the elements of the
universal set X whose membership grades in A are greater
than or equal ( or only greater than) the specified value of
.

Implication (If then):

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.

Block Diagram for Fuzzy

System

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)

Steps in the design of a fuzzy

controller:
Step -1: After identifying relevant input & output
variables of the controller & ranges of their values, we
have to select meaningful linguistic states for each
variable & express them by appropriate fuzzy sets. In
most cases, these fuzzy sets are fuzzy numbers, which
represent linguistic labels such as app. Zero, positive
small, negative small, positive medium, & so on.
NL
PL
NM
PM
NS
PS
AZ
Step-2: A fuzzification function is introduced for each
input variables to express the associated measurement
uncertainty.

Steps in the Design of a Fuzzy Controller

(Contd.):
Step-3: In this step, the knowledge pertaining
to the given control problem is formulated in
terms of a set of fuzzy inference rules.
There are two principal ways of determining
the relevant inference rules:
(1)One way is to elicit them from experienced
human operators.
(2) The other way is to obtain them from
empirical data by suitable learning methods,
usually with the help of neural networks.

Steps in the Design of a Fuzzy Controller

(Contd.):
Step-4: Measurement of input variables of a
fuzzy controller must be properly combined
with relevant fuzzy inference rules to make
inferences regarding the output variables.
There is the purpose of the inference
engine.
Output combining rules: (For fuzzified output)
(i)Max-min rule:
(ii)Max-Dot (Max-Product)
(iii)Averaging
(iv) Root Sum Square (RSS)

Steps in the design of a fuzzy controller

(Contd.):
Step-5: Defuzzification method:The purpose of defuzzification is to
convert each conclusion obtained by the
inference engine, which is expressed in
terms of a fuzzy set, to a single real number.
Methods of Defuzzification:
(i)Centre of area method (Centroid method or
Centre of gravity method)
(ii) Centre of maxima method:
(iii) Mean of Maxima method:
(iv) Weighted average method:
(v) Centre of sums method:

The first step in implementing FL is to decide

exactly what is to be controlled and how.
For example, suppose we want to design a
simple proportional temperature controller with
an electric heating element and a variablespeed cooling fan. A positive signal output calls
for 0-100 percent heat while a negative signal
output calls for 0-100 percent cooling. Control is
achieved through proper balance and control of
these two active devices.
It is necessary to establish a meaningful system
for representing the linguistic variables in the
matrix.

For this example, the following will be used:

"N" = "negative" error or error-dot input level
"Z" = "zero" error or error-dot input level
"P" = "positive" error or error-dot input level
"H" = "Heat" output response
"-" = "No Change" to current output
"C" = "Cool" output response
Define the minimum number of possible input
product combinations and corresponding output
response conclusions using these terms. For a
three-by-three matrix with heating and cooling
output responses, all nine rules will need to be
defined. The conclusions to the rules with the
linguistic variables associated with the output
response for each rule are transferred to the
matrix.

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

SYSTEM OPERATING RULES

Linguistic rules describing the control system
consist of two parts; an antecedent block
(between the IF and THEN) and a consequent
block (following THEN).
Depending on the system, it may not be
necessary to evaluate every possible input
combination (for 5-by-5 & up matrices) since
some may rarely or never occur.

ERROR & ERROR-DOT FUNCTION MEMBERSHIP

The degree of membership for an "error" of -1.0
projects up to the middle of the overlapping part of
the "negative" and "zero" function so the result is
"negative" membership = 0.5 and "zero" membership
= 0.5. Only rules associated with "negative" & "zero"
error will actually apply to the output response. This
selects only the left and middle columns of the rule
matrix.
For an "error-dot" of +2.5, a "zero" and "positive"
membership of 0.5 is indicated. This selects the
middle and bottom rows of the rule matrix. By
overlaying the two regions of the rule matrix, it can be
seen that only the rules in the 2-by-2 square in the
lower left corner (rules 4,5,7,8) of the rules matrix will
generate non-zero output conclusions. The others
have a zero weighting due to the logical AND in the

INPUT DEGREE OF MEMBERSHIP

"error" = -1.0: "negative" = 0.5 and "zero" = 0.5
"error-dot" = +2.5: "zero" = 0.5 and "positive" = 0.5
ANTECEDENT & CONSEQUENT BLOCKS (e = error, er =
error-dot or error-rate)
Now referring back to the rules, plug in the membership
function weights from above. "Error" selects rules
1,2,4,5,7,8 while "error-dot" selects rules 4 through 9.
"Error" and "error-dot" for all rules are combined to a
logical product (LP or AND, that is the minimum of either
term). Of the nine rules selected, only four (rules 4,5,7,8)
fire or have non-zero results. This leaves fuzzy output
response magnitudes for only "Cooling" and
"No_Change" which must be inferred, combined, and
defuzzified to return the actual crisp output.

In the rule list below, the following definitions apply:

(e)=error, (er)=error-dot.
1. If
2. If
3. If
4. If
5. If
0.5
6. If
7. If
8. If
9. If

(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

Cool 0.5 & 0.0 = 0.0

Heat 0.5 & 0.0 = 0.0
Heat 0.0 & 0.0 = 0.0
Cool 0.5 & 0.5 = 0.5
No_Chng 0.5 & 0.5 =

(e
(e
(e
(e

>
<
=
>

0)
0)
0)
0)

AND
AND
AND
AND

(er
(er
(er
(er

=
>
>
>

0)
0)
0)
0)

then
then
then
then

Heat 0.0 & 0.5 = 0.0

Cool 0.5 & 0.5 = 0.5
Cool 0.5 & 0.5 = 0.5
Heat 0.0 & 0.5 = 0.0

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.

The MAX-DOT or MAX-PRODUCT method scales each

member function to fit under its respective peak
value and takes the horizontal coordinate of the
"fuzzy" centroid of the composite area under the
function(s) as the output. Essentially, the member
function(s) are shrunk so that their peak equals the
magnitude of their respective function ("negative",
"zero", and "positive"). This method combines the
influence of all active rules and produces a smooth,
continuous output.
The AVERAGING method is another approach that
works but fails to give increased weighting to more
rule votes per output member function. For example,
if three "negative" rules fire, but only one "zero" rule
does, averaging will not reflect this difference since
both averages will equal 0.5. Each function is
clipped at the average and the "fuzzy" centroid of
the composite area is computed.

The ROOT-SUM-SQUARE (RSS) method combines the effects

of all applicable rules, scales the functions at their
respective magnitudes, and computes the "fuzzy" centroid
of the composite area. This method is more complicated
mathematically than other methods, but was selected for
this example since it seemed to give the best weighted
influence to all firing rules.
DEFUZZIFICATION: GETTING BACK TO CRISP NUMBERS
The RSS method was chosen to include all contributing rules
since there are so few member functions associated with the
inputs and outputs. For the ongoing example, an error of -1.0
and an error-dot of +2.5 selects regions of the "negative"
and "zero" output membership functions. The respective
output membership function strengths (range: 0-1) from the
possible rules (R1-R9) are:
"negative" = (R1^2 + R4^2 + R7^2 + R8^2) (Cooling) =
(0.00^2 + 0.50^2 + 0.50^2 + 0.50^2)^.5 = 0.866.

"zero" = (R5^2)^.5 = (0.50^2)^.5 (No Change) = 0.500

"positive" = (R2^2 + R3^2 + R6^2 + R9^2) (Heating) =
(0.00^2 + 0.00^2 + 0.00^2 + 0.00^2)^.5 = 0.000.
A "FUZZY CENTROID" ALGORITHM
The defuzzification of the data into a crisp output is
accomplished by combining the results of the inference
process and then computing the "fuzzy centroid" of the area.
The weighted strengths of each output member function are
multiplied by their respective output membership function
center points and summed. Finally, this area is divided by the
sum of the weighted member function strengths and the
result is taken as the crisp output.
(neg_center * neg_strength + zero_center * zero_strength +
pos_center * pos_strength) = OUTPUT
(neg_strength + zero_strength + pos_strength)

(-100 * 0.866 + 0 * 0.500 + 100 * 0.000) = 63.4%

(0.866 + 0.500 + 0.000)

One feature to note is that since the zero center

is at zero, any zero strength will automatically
compute to zero. If the center of the zero
function happened to be offset from zero (which
is likely in a real system where heating and
cooling effects are not perfectly equal), then this
factor would have an influence.

Example: ERROR = +0.5F

INPUT DEGREE OF MEMBERSHIP
"error" = +0.50: "negative" = 0.0, "zero" =
0.75, "positive" = 0.25
"error-dot" = +2.5: "negative" = 0.0, "zero" =
0.50, "positive" = 0.50

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

Cool 0.00 & 0.00 = 0.0

Heat 0.75 & 0.00 = 0.0
Heat 0.25 & 0.00 = 0.0
Cool 0.00 & 0.50 = 0.0
No_Chng 0.75 & 0.50 =

> 0) AND (er = 0) then Heat 0.25 & 0.50 =

< 0) AND (er > 0) then Cool 0.00 & 0.50 = 0.0
= 0) AND (er > 0) then Cool 0.75 & 0.50 =
> 0) AND (er > 0) then Heat 0.25 & 0.50 =

"negative" = (R1^2 + R4^2 + R7^2 + R8^2)

(Cooling) = (0.0^2 + 0.0^2 + 0.0^2 +
0.50^2)^.5 = 0.50
"zero" = (R5^2)^.5 = (0.5^2)^.5 (No
Change) = 0.50
"positive" = (R2^2 + R3^2 + R6^2 + R9^2)
(Heating) = (0.00^2 + 0.00^2 + 0.25^2 +
0.50^2)^.5 = 0.354

Union :
Fuzzy union (): the union of two

fuzzy sets is the maximum (MAX) of

each element from two sets.

E.g.

A = {1.0, 0.20, 0.75}

B = {0.2, 0.45, 0.50}
A B = {MAX(1.0, 0.2), MAX(0.20, 0.45),
MAX(0.75,
0.50)}
= {1.0, 0.45, 0.75}

 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

for CRISP Sets

AB max A x , B x x X

Intersection :
Fuzzy intersection (): the

intersection of two fuzzy sets is just

the MIN of each element from the
two sets.

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

TALL & HANDSOME

for CRISP Sets

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

Composition Rule of Inference

[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

= {(1,1.0), (2,0.6), (3,0.5), (4,0.2)}

approximately little.

4
0.0
0.0
0.5
1.0

Illustrations of Fuzzy Propositions

Composition/Evaluation (Earl Cox)

Illustrations of Fuzzy Propositions

Composition/Evaluation (from Earl Cox)

Illustrations of Fuzzy Propositions

Decomposition Defuzzification/Action (from
Earl Cox)

Where not to use fuzzy

logic
Do not use fuzzy logic if:

Humans do not understand the system

Different experts disagree
Knowledge can not be expressed with verbal
rules
Gut instinct is involved
Not just objective analysis

A fuzzy logic system is limited

Piece-wise linear approximation to a system
Non-linear systems can not be approximated
Many environment applications are non-linear

Hybridization of Soft Computing

Tools
A Simple Neuro-Fuzzy

Architecture
reasoning used by a neural
The

network is almost impossible to follow

for a human user.
But neural networks have the power of
automatically learning input-output
relationships.
Fuzzy rule based systems are highly
interpretable.
But it cannot learn the rules
automatically.

Solution

Judicious integrations of neural

networks and fuzzy logic are

expected to have human
interpretability as well as the ability
to learn.

Example: A Neuro-Fuzzy
Architecture with Feature
Selection Capability

Functionalities of the Nodes in

Different Layers
Layer 1: Act as a buffer to the inputs
Layer 2:
Fuzzifies the input.
Performs feature selection with the help
of a special feature modulator function.
For unimportant features, the output of
the nodes in layer 2 is modulated such
that it has no effect on the output.

Functionalities of the Nodes in

Different Layers (contd.)
Layer 3: Performs AND-ing (min or
product) of input fuzzy sets.

Layer 4: Performs OR-ing (max) of

the rules having the same
consequent.

Layer 5: Defuzzifies the fuzzified

output by calculating the center of

mass of the output fuzzy sets.

Parameters to be Learned
Weights associated with the links

between the nodes of layer 3 and

layer 4. These are nothing but the
certainty factors of each rule.

Modulator values associated with

each node in layer 2. By learning

these values the system can
differentiate between relevant and
redundant features.

The Three Phases of

Learning
Phase 1: Both certainty factors of rules

and feature modulators are learnt in this

phase. After learning the redundant
features are got rid of.

Phase 2: Now the reduced network learns

only the certainty factors. After learning,
the inconsistent rules are thrown away.

Phase 3: The network with an optimal

number of nodes learns the certainty

factors to adapt to its new architecture.

Extracting the Rules from the

Network

To generate a consistent rule base there

must be only one consequent for a
particular antecedent.

We calculate the centroid of the

incompatible rules corresponding to a

particular antecedent using the certainty
factors.

The consequent for which the centroid has

the highest membership value is chosen
as the consequent of the antecedent in

Evolutionary Algorithms and Fuzzy

Logic
Fuzzy Government

Evolutionary Algorithm
fuzzy fitness
fuzzy operators

1
Fuzzy Sistem

Fuzzy System Design and

Optimization
Representation
Genetic operators
Selection mechanism
Example: Learning fuzzy classifiers

Representation of a Fuzzy Rulebase

c1

c2

c3

c4

totally overlapping membership functions

1001100011011010 membership function genes

N
max
=
N
dom
00001010

input

input

* Noutput rule genes of value (0 ... Ndom)

output

FA1 FA2 FA3 FA1 FA2 FA3 R1 R2

genotype

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

no. domains = 1 + exponential(3)

IF

Output variables

b C c
d
min a
no. domains = 2 + exponential(3)

Rules

no. rules = 2 + exponential(6)

is

AND

is

AND

is

AND

is

THEN

max

is

for each input variable, flip a coin to decide whether to include

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:

EAs easy to implement

little specific knowledge required
long computing time

Features:

complex dynamics
non-binary conditions
intuitive knowledge available

Knowledge Acquisition
ALGORITHM

statistics

visualization

KNOWLEDGE

Fuzzfying Evolutionary
Algorithms

Fuzzy fitness (objective function)

Fuzzy encoding
Fuzzy operators
recombination
mutation

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

Fuzzy Neural Networks

x1
x2

w11
w12

AND
wm1

v1

wm 2

OR

w1n
xn

wmn

AND

vm