U SE OF G ENETIC A LGORITHMS FOR C LASSIFICATION OF D ATASETS
{ N ITIN K UMAR , 216CS1140 } CSE DEPARTMENT, NIT R OURKELA
I NTRODUCTION
Genetic Algorithms (GA) are search-oriented
repetitive optimization strategies built on the con-
cepts of natural selection theory and biological
genetics. In Genetic Algorithms, we have a set
of possible candidate solutions to a problem at
hand. These solutions are transformed into other
solutions using mutation and recombination, pro-
ducing new children solutions. And this process
is continued for several iterations. This study
shows the comparison of performance of various
popular classification algorithms against GA with
respect to accuracy of the classification.
M ETHODS OF GA
1. Selection: This operator is used in selecting
individuals for reproduction. Various selection
methods are
• Roulette wheel selection
• Random selection
• Rank selection
• Tournament selection
• Boltzmann selection
2. Crossover: This is the process of taking two
parent chromosomes and producing a child from
them. This operator is applied to create better
string. Various types of cross over operators are
• onepoint crossover
• multi-point crossover
• uniform crossover
• whole arithmetic recombination
3. Mutation: Randomly inverted gene in parent
chromosome would produce the child chromo-
some. Mutation is very much needed for diver-
sity of the population.
R EFERENCES
[1] Shanabog CS Nandish and UM Ashwinkumar. Use
of genetic algorithms for classification of datasets.
Recent Trends in Electronics, Information & Communi-
cation Technology (RTEICT), 2017 2nd IEEE Interna-
tional Conference on, pages 2016–2020, 2017.
O BJECTIVE
The aim of this project is to create a classification
engine based on genetic algorithm that will train
itself from the training data provided, and be able
to classify. The classification engine that is be-
ing developed here is based on a type of machine
learning algorithm called genetic algorithm. The
classification engine will train itself to the max-
imum possible level by refining itself with ade-
quate attention being paid to ensure the engine
will not be over-fitted, meaning the classification
engine will be able to classify any input instances
precisely, not confining to the training data.
M ETHODS OF GA
Commonly used mutation techniques are
• bit flip mutation
• random resetting
• swap mutation
• scramble mutation
• inversion mutation
4. Survivor selection: The policy that help us
in finding out which chromosomes to retain for
the next generation, and which chromosomes to
be discarded is called as survivor selection policy.
Most commonly used survivor selection schemes
are
• Age based selection
• Fitness based selection
5. Termination condition: It is highly important
to design the termination condition of any ge-
netic algorithm very carefully, since it determines
when to end the genetic process. If the termina-
tion condition has not been designed correctly, it
may lead to infinite loops.
F UTURE W ORK
In this poster we have presented an approach for classification of datasets. As a way to validate the
proposed method, we have tested with machine learning data sets taken from UCI repository. Future
work may include different datasets and more number of classifiers. Using different data sets may also
be useful to test the proposed system performance.
G ENETIC A LGORITHM F LOW C HART
timization problems.GA uses genetics as itâĂŹs
model as problem solving. Each solution in ge-
netic algorithm is represented through chromo-
somes. Chromosomes are made up of genes,
which are individual elements (alleles) that rep-
resent the problem. The collection of all chromo-
somes is called population. Generally there are
three popular operators are use in GA.
• Population : The evolution usually starts
from a population of randomly generated
individuals. In other words, population is
a group of chromosomes.
• Fitness Function : Individual solutions are
selected through a fitness process. Fitness
function in simple words depicts how âĂIJ-
Figure 1: Flow Chart
fitâĂİ or how âĂIJbadâĂİ is a solution to a
Genetic algorithms are useful for search and op- given problem.
R ESULTS
on our training dataset that shows the ac-
curacy of 76.46 percent with 10 folds cross-
validation and 76.56 percent with 66 percent
split of the training dataset
• IBk Classifier: The IBk classifier is applied
on our training dataset that shows the ac-
curacy of 75.16 percent with 10 folds cross-
validation and 74.16 percent with 66 percent
Figure 2: Classification Accuracy
split of the training dataset.
• ZeroR classifier: The ZeroR classifier is ap- • Genetic Algorithm: The GA classifier is ap-
plied on training dataset that shows the ac- plied on our training dataset with the ac-
curacy of 59.90 percent with 10 folds cross- curacy of 81.33 percent with 10 folds cross-
validation and 63.16 percent with 66 percent validation and 80.95 percent with 66 percent
split of the training dataset. split of the training dataset.
• J48 Classifier: The J48 classifier is applied
C ONCLUSION
Genetic algorithm has provided the maximum
classification accuracy 81.33 percent with 10-fold
cross validation and 80.35 percent with 66 percent
splitting.