Professional Documents
Culture Documents
Presented By
Dr. Bhupendra Verma
Director,
Technocrats Institute of Technology( Excellence), Bhopal
Chromosome Representation
{ W11,W12, W21, W22, V11,V12, V21, V22}
Each Gene is a real value coded in decimal
digits.
We are considering weights up to three decimal
places so the number of digits required is 4.
One digit is required for sign ( +/-)
Ex
{84321 46242 34523 76587 34276 98767
23443 92313 }
Fitness Function
F=
1/ RMSE
Ex
With the Michigan approach - where each individual represents a
single rule - using a binary encoding. Then the generalizing /
specializing crossover operators can be implemented as the logical
OR and the logical AND, respectively
IF
THEN
C,
Actual Class
FP
FN
TN
(TP)(TP) / (TP+FP)(TP+FN)
GA for Clustering
Crucial issue in the design of an GA for clustering is
to decide what kind of individual representation will
be used to specify the clusters
- Cluster description-based representation:
In this case each individual explicitly represents the parameters
necessary to precisely specify each cluster. Nature of parameter
depends on shape of cluster
Instance-based
representation
In this case each individual consists of a string of n
elements (genes), where n is the number of data
instances. Each gene i, i=1,. . . ,n, represents the index
(id) of the cluster to which the i-th data instance is
assigned. Hence, each gene i can take one out of K
values, where K is the number of clusters.
Example
suppose that n = 10 and K= 3. The individual <2 1 2 3
3 2 1 1 2 3> corresponds to a candidate clustering
where the second, seventh and eighth instances are
assigned to cluster 1, the first, third, sixth and ninth
instances are assigned to cluster 2 and the other
instances are assigned to cluster 3.
Research Problems
Discovering surprising rules:
Evolutionary algorithms seem to have a good potential to
discover truly surprising rules, due to their ability to cope
well with attribute interaction.
- An interesting research direction is to design new
surprisingness measures to evaluate the rules produced
by evolutionary algorithms
Scaling
Algorithms
Processing:
up
Evolutionary
with
Parallel
References