GENETICFUZZYSYSTEMS

FuzzyRulebasedsystem:
- Designoftheinferencemechanism
- Generationofthefuzzyruleset(KB)
o Learningprocess:AutomaticgenerationormodificationoftheKB

Optimization:
- FindinganappropriateKBtosolveanspecificproblem
- Parameters:FuzzyrulesandFuzzymembershipfunctions
- Maximizeorminimizeafitnessfunctionthatdescribesthedesiredbehaviorofthesystem

Steps:
1. WhichpartsoftheKBaresubjecttooptimization?

Tuning: Optimization of an existing FRBS; tuning process assumes a predefined RB and have the
objectivetofindasetofoptimalparametersforthemembershipand/orthescalingfunctions.
Learning: Automated design method for fuzzy rule sets that starts from scratch. Learning process
performsamoreelaboratedsearchinthespaceofpossibleRBsorwholeKBsanddonotdependon
apredefinedsetofrules.

GeneticTuningofthedatabase
Tuningthescalingfunctions:
Normalize the universe of discourse, in which the fuzzy membership functions are defined (Gains
associatedwiththevariables).

Tuningthemembershipfunctions:
An individual represents the entire DB as its chromosome encodes the parameterized membership
functionsassociatedtothelinguisticterms.

Geneticlearningoftherulebase
Assumes a predefined set of fuzzy membership functions in the DB to which the rules refer to by
means of linguistic labels. The EA adapts the RB, either working with chromosomes that describe a
singlefuzzyruleoranentireRB.

Aphenotypespaceofrulebases/knowledgebases
- Phenotypespaces:
o Thespaceofrules
o ThespaceofentireRBsorKBs
- Eachchromosomerepresentsanindividualrule
- Thepopulationasawholeconstitutesthesolutiontheoptimalsetofrules
- Michiganapproach:TherulesthatformtheRBareevolvedsimultaneously
- IterativeRuleLearningapproach:Rulesareprogressivelyaddedtothelist
- Pittsburghapproach:IndividualsrepresentacompleteRBorKB

2. HowtheGAsolvestheoptimizationproblem?
GeneticTuningofmembershipfunctions
- MeansquareerrorbetweentheFSBSoutputandatrainingdatasetastheirfitnessfunction.
The objective of the tuning process is to improve the approximation accuracy of the FRBS over
thetrainingdataset E
p
.ThefitnessvalueforaparticularchromosomeC
]
iscomputedasthemean
squareerror(MSE)betweentheFRBSoutputS(cx
I
)andthetrainingdataoutput cy
I
:

E(C
]
) =
1
2| E
p
|
(cy
I
S(cx
I
) )
2
c
l
L
p

InthisparticularcasetheEAtriestominimizeratherthanmaximizethefitness E(C
]
).

Shapeofthemembershipfunctions
- Limitsoftheoperatingrange
- Eachtuningparametercanassumeadiscreteorcontinuousvaluewithinagivenrange
- Strongfuzzypartition:Fuzzysetsintersecthalfwaybetweentheircenterpointsataheightof
0.5.
- Semanticsorderingrelation:Theorderofthelinguisticlabelsismaintained.

Theapproximategenetictuningprocess
1. EachchromosomeencodesacompleteapproximateMamdanitypeFSB.
2. The k t triangular-shaped membership functions is parameterized by a 3 tuple of real
values such the i t rule is encoded by the partial chromosome C
]
, i = 1, , m = n +1, as
follows:
C
]
= (o
1
, b
1
, c
1
, , o
n
, b
n
, c
n
, o

, b

, c

)
In which (o
k
, b
k
, c
k
) are the three characteristic points of the k t input fuzzy set in the rule
antecedent,and (o

, b

, c

),thosefortheoutputfuzzysetintheruleconsequent.
3. The initial population contains one exact copy of the prototype chromosome C
1
, while the
remainingchromosomesareinitializedbyuniformlydrawingthevaluesc
h
atrandomfromits
intervalofadjustment |c
h
I
, c
h

].

LearningwithGeneticAlgorithms
Michiganapproach:eachindividualencodesasinglepredictionrule
Pittsburgapproach:eachindividualencodesasetofpredictionrules

TheMichiganApproach
- Classifiersystems(CSs)areproductionrulesystemsthatautomaticallygeneratepopulations
ofrulescooperatingtoaccomplishadesiredtask.
- CSsusetheGAasadiscoveryoperatortogenerateclassifiers.
- EachclassifierisanIFTHENrule,withaconditionpartandanactionpart.

1. Theperformancesystem:

- Directlyinteractswiththeenvironment:
o Input interface: Translates the current state
oftheenvironmentintostandardmessages
o Outputinterface:Translatessomemessages
into actions that modify the state of the
environment.
o Set of rules: represented as strings of
symbols over a three valued alphabet with
acondition/actionformat.
o Pattern matching system: identifies which
classifiers are matched or satisfied in each
cycle.
o Messagelist:Containsallcurrentmessages,
those generated by the detectors and those
sentbyfiredclassifiers.
o Conflictresolution(CR)system:
Determiningwhichmatchedclassifiersfirewhenthesizeofthemessagelistis
smallerthanthenumberofmatchedclassifiers.
Deciding which actions to choose in case of inconsistency in the actions
proposedtoeffectors(e.g.turnleftandturnright)

2. Thecreditassignmentsystem

- Somehowthesystemmustevaluatetherules.
- Learning by the modification and adjustment of conflict resolution parameters of the
classifier.

3. Theclassifierdiscoverysystem

- AstheGAusesclassifierstrengthasameasureoffitness,itcanbeusefullyappliedtotheset
of classifiers only when the CA system has reached steady state (when classifier strength
accurately reflects its usefulness), therefore, it is applied with a lower frequency, usually
between1000and10000CAsystemcycles.
- AGAbasicexecutioncycleisafollows:

1. TaketheclassifiersetasinitialpopulationP.
2. Rank individuals of P in decreasing fitness order using the strength associated to every
classifierasameasureoffitness.
3. Choose2kindividualstobereplacedamonglowrankeduselessones.
4. Choosekpairsofindividualstobereplicatedamonghighrankedusefulones.
5. Applygeneticoperatortothekpairsselectedatstep4,creatingoffspringclassifiers.
6. Replacethe2kindividualsselectedatstep3withtheoffspringcreatedatstep5.

Basicoperationsofaclassifiersystem
1. Initially, a set of classifiers is created randomly or by some algorithm that takes into account
thestructureoftheproblemdomainandtheyallhaveassignedthesamestrength.
2. Theinputinterfaceisallowedtocodethecurrentenvironmentaloutputsignalsasmessages.
3. Allmessagesfromtheinputinterfaceareaddedtothemessagelist.
4. The pattern matching system determines the set of classifiers that are matched by the
currentmessagesofthemessagelist.
5. The CR system resolves conflicts between matched classifiers and determines the set of
activeclassifiers.
6. Themessagelistispurged.
7. Themessagessuggestedbytheactiveclassifiersareplacedonthemessagelist.
8. Anyeffectorsthatarematchedbythecurrentmessagelistareallowedtosubmittheiractions
totheenvironment.Inthecaseofinconsistentactions,theCRsystemiscalled.
9. Ifarewardsignalispresent,itisdistributedwiththeCAsystem.
10. IftheCAsystemhasreachedasteadystate,theGAisappliedovertheclassifierset.
11. Returntostep1.

ThePittsburghApproach
While the Michigan approach is mainly concerned with continuous (on-line) learning in non
inductive problems, the Pittsburg one is particularly adapted for training in inductive and non
inductiveproblems.

In the Pittsburgh approach, each individual represents a complete entity of knowledge and,
consequently, interaction among different individuals does not occur in the evaluation of that
knowledge.
Thatsituationavoidstheneedofcreditassignmentandthusthedefinitionofcomplexalgorithms
withthatpurpose.
Pittsburgh approach employs a population of RBs (individuals are RBs) which are evaluated
withintherulebasedsystemoneatatime.InaCS,thewholepopulationconstitutestheRBand
consequently the population is a part of the performance system as it is considered as a single
entity.

GeneticFuzzyRuleBasedSystemsBasedontheMichiganApproach

EachFuzzy ruleplaystheroleofaclassifier.TheMichiganapproachgraduallyevolvesasingle
RBconstitutedbytheentirepopulationoffuzzyrules.
Eachchromosomeonlycontainsthecodeforasinglefuzzyrule.

BasicFeaturesofFuzzyClassifierSystems
CodingschemeinwhichaclassifierisaDNFruleoftheform
IF X
1
is {C
11
or C
13
] AN X
3
is C
32
IEEN
1
IS
14

The classifiers are represented as binary strings that encode the linguistic terms involved in the
conditionandactionpartsofthefuzzyrule.
Theactionandtheconditionpartsareseparatedbyaslash(/)
Multipleconditionsareassumedtobeconnectedbyanimplicitand
The number of bits in a condition or an action part is identical to the number of linguistic terms
definedoverthegivenvariable.An1-bitindicatesthepresenceofthecorrespondinglabelinthe
conditionortheaction.
AssumeaDBforthethreelinguisticvariables X
1
, X
2
, X
3
,eachonepartitionedintothreelinguistic
fuzzyterms{Low,Medium,High}
00:110, 01:101 / 11:001
IF X
0
is {Iow or HcJium] AN X
1
is {Iow or Eig] IEEN IS Eig
00 X0
01 X1
10 X2
11 X3
Low, Medium, High (111)

Fuzzymessages
Iscomposedoftwosubstrings,ofwhichthefirstidentifiesthevariabletowhichthemessagerefers
andtheseconddescribesthelinguistictermconnectedtothatvariable(00:110).
Theoveralllengthofafuzzymessagedependsonthenumberofvariables,namelythenumberofbits
required to binary code their index, and the number of linguistic terms associated to the referred
variable.
For each input message, the input unit computes the membership value of the corresponding
linguistictermforthecurrentcrispvalueoftheinputvariable.Thisdegreeofmembershipdetermines
the activation level of the message. Messages with a zero membership degree are immediately
discarded,whereastheotheronesareaddedtothecurrentmessagelist.

Fuzzymatchingoffuzzyclassifiersanddefuzzification
To compute the activity level, the FCS considers the degree of activation of those messages that
matchtheclassifierconditionpart.
Eachtimeaclassifierfires,itsactionpartistranslatedintoasetofminimalmessagesthatareposted
tothemessagelist.
The output unit scans the message list for messages that refer to output variables and aggregates
theiroutputsusingmaxmininference.
The output fuzzy set to which the linguistic label in the message refers is clipped by the level of
messageactivation.
Thecrispoutputiscomputedasthecenterofgravityoftheunion(overeachvariable)ofthosefuzzy
sets.

Creditassignmentandfuzzybucketbrigade
Is a mechanism to reward or penalize individual classifiers based on their contribution to the overall
successoffailureoftheentireFCS.
Thebucketbrigadealgorithmadjuststhestrengthofindividualclassifiersbydistributingtheobtained
reward across the sequence of active classifiers that directly or indirectly contributed to the past
actionstakenbytheFCS.
Initially, each classifier rule starts with a fixed strength. Subsequent to the generation of a crisp
output, the environment provides a feedback signal, by passing a reward to the output unit that
indicatesthedesirabilityofthepreviouslytakenaction.
Thisrewardisdistributedtothoseclassifiersthatgeneratedtheoutputmessage.
Therewardissharedamongallclassifiersthatcontributedtotheaction.

CreationofnewrulesthroughaGA
1. The input unit receives input values, encodes them into fuzzy messages, and adds these
messagestothemessagelist.
2. The population of classifiers is scanned to find all classifiers whose conditions are at least
partiallysatisfiedbythecurrentsetofmessagesonthelist.
3. Allpreviouslypresentmessagesareremovedfromthelist.
4. Allmatchedclassifiersarefiredproducingminimalmessagesthatareaddedtothemessage
list.
5. Theoutputunitidentifiestheoutputmessages.
6. Theoutputunitdecomposesoutputmessagesintominimalmessages.
7. Minimalmessagesaredefuzzifiedandtransformedintocrispoutputvalues.
8. External reward from the environment and internal taxes raised from currently active
classifiersaredistributedbackwardstotheactiveclassifiersduringthepreviouscycle.

Reference

GeneticFuzzySystems:EvolutionaryTuningandLearningofFuzzyKnowledgeBases
Oscar Cordn, Francisco Herrera, Frank Hoffmann, Luis Magdalena.
World Scientific, 2001