HYBRID SYSTEMS

CHAPTER - IV

HYBRIDSYSTEMS

1.1 Hybridization of Neural Network. Fuzzy Logic and Genetic

Algorithms
Neural Network, Fuzzy Logic and Genetic Algorithms are three distinct
methodologies each with its own advantages and disadvantages. It is therefore
appropriate that a hybridization of the three technologies is attempted to overcome the
weakness of one with the strength of the other.

1.2 Hybridization of Neural Network and Fuzzv Logic (Neuro-Fuzzy

Hybrids’!
Neural Network and Fuzzy Logic represents two distinct methodologies to
deal with the uncertainty. Each of them has its own merits and demerits. Neural
Network can model complex nonlinear relationship and are appropriately suited for
classification phenomenon into predetermined classes. On the other hand, the
precision of outputs is quite often limited and does not admit zero error but only
minimization of least squares errors. Besides, the training time required for a Neural
Network can be substantially large. Also the training data has to be chosen carefully
to cover the entire range over which the different variables are expected to change.
Fuzzy Logic systems address the imprecision of inputs and outputs directly by
defining them using fuzzy sets and allow for a greater flexibility in formulating
system description at the appropriate level of detail.
Neural network and Fuzzy Logic though different technologies, can be used to
accomplish the specification of mathematical relationships among numerous variables
in a complex dynamic process, perform mappings with some degree of imprecision, in
different ways, and can be used to control nonlinear system to an extent not possible
with conventional linear control systems.

46
1.2.1 Fuzzv BQckpropQQQtion Network

1.2.2 Fuzzv Back Propagation Training algorithm

{/* Let the configuration of fuzzy Back Propagation be l-m-n */}

Step 1: Randomly generate the initial weights sets W for the input-hidden layer

where each Wji = (Wmji,, Wpjj) is an LR-type fuzzy number. Also

generate the weight set Iv for the hidden-output layer

where WkJ = (W^kj, ).

Step 2: Let(Ip,Dp), p = 1, 2, 3,...., N be the N input-output pattern set, that fuzzy

BP needs to be trained with. Here, / = (Ip0,IP\Jp2>............,/,)where

each I pi is an LR-type fuzzy number, i.e. Ipi = (Ipmi, Ipcd, 1 pf}l). Dp is a crisp

number.
Step 3: Let ITRNS denote the number of iterations. Set the counters for the number
of iterations and number of pattern sets to be trained to zero, i.e.
COUNT_OFJTRNS = 0; p =1;
Step 4: Assign vale for r] and a.

Initialize: AW(t -1) = 0

AW/(f-l) = 0

Also, W(t -1) = 0 1) = 0

Step 5: Get next pattern set(Ip,Dp). AssignOpi = Ip., i = 1,2,3,.... ,/;

dQ = (1,0,0) for the input neurons.

Step 6: Compute Opj = f(NETpj), j = 1,2,3...,m;O'p0 = 1

Where NETpj = CE for the hidden neurons.

V ;=o J
Step 7: Compute Opk = f(NET'Bk ),k = 0,1,2.... . n -1
Pk ■

( m "N
Where NETpk = CE Wkj Opj for the output neurons.
v;=° J

47
Step 8: Compute the change of weights AW'(t) for the hidden output layer as
follows:

3Bp SEp SEp

8.1: Compute VjEp (t) = Where

3£„
(DM-o;)o;a-o;).i.o;, Pk Pj

akj

<Dpl-o;,,)o;ka-o;k)±.o'pi
swm

8.2: Compute AW'(f) = -J]VEp (t) + aAW'(t -1)

Step 9: Compute the change of weights AW(t) for the hidden input layer as
follows:
9.1: =~(Dpk-o;k)o;k(i-o;k).i.

■i
peek <DPk-o;k)o;k(\-o:k),
\ pk ^pk'^pk^ ^ pk ' ^

<Dpk-0')0:k(l-0’).l
pk ^pk pk
Pk' 3
f
dEn dEn BE,,
Compute VEpp(A=z
(t) = Where
ydW^dW^dW^j
dE \
o'„d-o;,).i.dp,

3E f
o'^-o'^y-o.
aw# w 2
sep (
dW.» V k

9.2: Compute AW'(t) = -JjVEp (t) + aAW'(t)

Step 10: Update weights for the input hidden and output hidden layers as

W(t) = W(t-l) + AW(t)

48
 W'(t)=W'(t-l) + AW'(t)
Step 11: p=p+ 1
If (p<ri), go to step 5;
Step 12: COUNTJDFJTRNS < ITRNS
{Reset pointer to first pattern in the training set;
p= l;
Go to step 5;
}

Step 13: Output W and W' the final weight sets.

End
1.2.3 Fuzzy Back Propagation Inference algorithm

{/* Fp,p = 1,2,3...., N', be the patterns whose output values are to be inferred.

Let W and W' be the weight sets obtained after training fuzzy BP */
Step 1: P=l.
Step 2: Get next pattern Fp;

Step 3: Compute Opi = Fpi,i = 1,2,3...,Z

O0 = (1,0,0) for the input neurons.

Step 4: Compute 0'pj = f(NETpj), j = 1,2,3..., m; O'p0 = 1

( i
Where NETpj = CE W,pi for the hidden neurons.
V«=0 y
Step 5: Compute Opk = f(NETpk),k
pk ‘
= 0,l,2,....,n-l
( m

Where NETpk = CE 7j>*<** for the output neurons.

\i«
Step 6: Output the associated output Opk, k = 0,1,2,3....,» -1

Step 7: p = p + l;
If (p < N'), go to step 2;
End.

49
1.3 Hybridization of Neural Network and Genetic Algorithm (Neuro-

Genetic Hybrids)
Neural Networks can learn various tasks from training examples; classify
phenomena, and model nonlinear relationship. However, the primary features that are
of concern in the design of the network are problem specific. Despite the availability
of some guidelines, it would be helpful to have a computational procedure in this
aspect, especially for the optimum design of the Neural Network. Genetic algorithms
have offered themselves as potential candidates for the optimization of parameters of
Neural Network. The integration of Genetic Algorithms with Neural Network has
turned out to be useful.
Genetic Algorithms encode the parameters of neural networks as a string of
the properties of the network, that is, chromosomes. A large population of
chromosomes representing the many possible parameter sets for the given Neural
Network is generated. Combined GA-NN technologies also known as GANN have
the ability to locate the neighborhood of an optimal solution quicker than other
conventional search strategies.
1.3.1 Genetic Algorithm Based Backpropaqation Network

Coding
The parameter which represents a potential solution to the problem, genes, are
joined together to form a string of values referred to as a chromosome. Most
conventional Genetic Algorithms code these chromosomes into binary alphabets.
Assume a BPN whose network configuration is l-m-n(l input neurons, m hidden
neurons, and n output neurons). The number of weights that are to be determined are
(/+n) m. With each weight (gene) being a real number and assuming the number of
digits (gene length) in the weight to be d, a string S of decimal values representing
(/+n) m weights and therefore having a string length L = (/+n).m .d is
randomly generated. The string S represents the weight matrices of the input-hidden
and hidden-output layers, in a linear form, arranged according to row-major or
column-major order as selected by the designer. An initial population of p
chromosomes is randomly generated where p is referred to as the population size.

50
 Weight Extraction
To determine the fitness value for each of the chromosomes, we extract
weights from each of chromosomes.
Let xltx2,..... ,xd,.... ,xLrepresents a chromosomes and xkd+],xkd+2,......,x(k+])d

represents the kth gene (k > 0) in the chromosome. The actual weight wk is given by

Xkd+2-10 + -*:fa/+3-10 +..............................+ X(k+\)d

+ 5^xkd+1 -9

w. 10 d-2
Xkd+2-10 +Xkd+3-1® +...............................+ JC(it+l)d
0 ^ xkd+1 < 5
d-2
10
Algorithm for Fitness of the Chromosome
{Let = 1,2,3,...., N where lt =(Iu,I2n ,/„) and

Ti = (Tu,T2i,.... ,Tni) represents the input-output pairs of the problem to be solved by

BPN with a configuration l-m-n.

For each chromosome C,-,i = 1,2,3....,pbelonging to the current population

Pt whose size is p

{Extract weights from C,;

Keeping Wi as a fixed weight setting, train the BPN for the n inputs
instances;
Calculate error for each of the input instances using the formula

E,='Z<Til~01,f
j

Where Ot is the output vector calculated by BPN.

Find the root mean square E of the errors Ei, i = 1,2,3. .../V

E=

Calculate the fitness value Fi for each of the individual string of the
population as

51
 }

Output Ft for each C,,i = 1,2,3...., p;

End
Algorithm for The Genetic Algorithm Based Weight Determination
{ i <- 0
Generate the initial population Pt of real coded chromosomes C'- each

representing a weight set for the BPN;

While the current population J^has not converged

{ Generate fitness value F- for each C'. e P‘ using the Algorithm

for fitness of the chromosome;

Get the mating pool ready by terminating worst fit individuals and
duplicating high fit individuals;
Using the cross over mechanism, reproduce offspring from the parent
chromosome;
i <— i +1
Call the current population Pt;

Calculate fitness values F‘ for each C' e P‘

Extract weights from Pi to be used by the BPN;

}
End.
1.4 Hybridization of Fuzzy Logic and Genetic AlqorithmsfFuzzy-

Genetic Hybrids!
Fuzzy system also can be integrated with Genetic Algorithms. Kosko (1992)
has shown that fuzzy systems like neural networks are universal approximators in the
fact that they exhibit the capability to approximate general nonlinear functions to any
desired degree of accuracy. The adjustment of system parameters that is called for in
the process, so that the system output matches the training data, has been tackled
using Genetic Algorithms. Several parameters which a fuzzy system is involved with,
52
namely input/output variables and the membership function that define the fuzzy
systems have been optimized using Genetic Algorithms.
1.4.1 Fuzzy Loaic Controlled Genetic Algorithm

Components of Fuzzy Logic Controller

Fuzzy Logic controller process is divided_into three stages.
1. Fuzzification
To calculate fuzzy input, (i. e. to evaluate the input variables with respect to
corresponding linguistic terms in the condition side)

2. Fuzzy Inference
To calculate fuzzy output, (i. e. to evaluate the activation strength of every
rule base and combine their action side)
3. Defuzzification
To calculate the actual output, (i. e. to convert fuzzy output into precise
numerical value)]

Fuzzy Logic Controller

Fuzzy Logic Controlled Genetic Algorithm Based Structural Optimization

First, coding scheme is to be defined and the initial population is produced.
The computation with genetic operators is used to evaluate fitness function with
respect to the objective function. Below a flow chart shows the Fuzzy Logic
Controlled Genetic Algorithm Based Structural Optimization procedure. Using FLC
we can get the expert’s experience in fuzzy rale base of FLC. Hence, the search can
find optimum solution quickly. As a result, computing time is very much reduced.
The predefined probability and fuzzy representation of design constraints causes FLC
to reduce the risk of premature problem solution caused by improper rale.

53
 Flow Chart of Fuzzy Logic Controlled Genetic Algorithm Based Optimization

1.5 Conclusion
❖ Hybrid systems are those employ integrated technologies to effectively solve
problems. Hybrid systems are classified as sequential, auxiliary and embedded
hybrids.
❖ The soft computing techniques of neural networks, fuzzy logic and genetic
algorithms have offered themselves as candidates for a healthy integration or
hybridization of technologies for effective problem solving.
❖ The synergy of the three technologies has led to neuro-fuzzy, neuro-genetic,
and fuzzy-genetic hybrids. In this chapter three hybrid systems namely genetic
algorithm based back propagation network (Neuro-Genetic Hybrid), Fuzzy
Back Propagation Network (Neuro-Fuzzy Hybrid) and fuzzy logic based
genetic algorithm (Fuzzy-Genetic Hybrid) are presented.

$ ^ $

* *

54