Beruflich Dokumente
Kultur Dokumente
ABSTRACT
In this paper we tend to gift application of hybrid clustering algorithms .Data cluster helps one recognize the structure of
i i i i i i i i i i i i i i i i i i i i
and alter the quality of huge quantities of information. It a typical technique for applied mathematics knowledge analysis
i i i i i i i i i i i i i i i i i i
and is employed in several fields, as well as machine learning, data processing, pattern recognition, image analysis, and
i i i i i i i i i i i i i i i i i i
bioinformatics. The well-known K-means algorithm, which has been successfully applied to many practical clustering
i i i i i i i i i i i i i i
problems, has several disadvantages due to its initialization selection. However, its performance depends on the initial
i i i i i i i i i i i i i i i i
centroid state and can be trapped in the local optima. Genetic algorithms are an evolutionary algorithm that is inspired by
i i i i i i i i i i i i i i i i i i i i
nature and used in the clustering field. In this paper, we propose a hybrid method. A hybrid technique based on the
i i i i i i i i i i i i i i i i i i i i i
combination of the K-means algorithm, the genetic algorithm, the Nelder–Mead simplex search and the K–GA-NM–
i i i i i i i i i i i i i i i
PSO particle swarm optimization is proposed. The KM-GA–NM–PSO searches for cluster centres of an arbitrary data
i i i i i i i i i i i i i i i
set as well as the K-means algorithm, but the global optima can be found effectively and efficiently. The new KM– GA-
i i i i i i i i i i i i i i i i i i i i i
NM– PSO algorithm is tested on UCI repository data sets and compared to K means and KM- GA clustering algorithms.
i i i i i i i i i i i i i i i i i i i i
This algorithm can be improved, such as image segmentation and university time tabling.“ The new technique K-mean–
i i i i i i i i i i i i i i i i i
GA–NM-PSO algorithm is tested on data sets, and its performance is compared with those of k-mean, GA, NM, PSO and i i i i i i i i i i i i i i i i i i i
K-means clustering. Results show that K–GA–NM-PSO are better than other cluster.”
i i i i i i i i i i i
Keywords:- K-means clustering, Genetic algorithm, Nelder-Mead search method, Particle swarm optimization; ii i i i i i i i i i
I.
INTRODUCTION i
In one cluster, divide each cluster into smaller clusters
i i i i i i i i
performance.
i i
effective method for find optimal solution. But GA
i i i i i i i i
objects.
i
i i
i i i i i i i
i i i i i i
i i i i i i i
i i i i i i i i
i i i i i i i i
i i i i i i
K-Mean Algorithm
applied one once another to get a brand new generation
i i
i i i i i i i i i i
i i i i i i i i
i i i i
i i i i i i
i i i i i i
i i i i i i i
i i i
i i i i i i
i i i i i i i i
i i i i i i i i i
function is
Step II [Fitness]: the fitness of each chromosome in the
i i i
i i i i i i i i i
population is evaluated.
i i i i
(1)
chance for each chromosome to be selected, as a parent,
i i i i i i ii i i i ii i i i i i i i i ii i i i ii i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i ii i i i ii i i
i i i i i i i i i i
In the uniform crossover bits the second’s parent is randomly copied from the first.
i i i i i i i i i i i i i
ii
3) Mutation: According to mutation probability (Pm), new offspring at each locus (position in chromosome) is
i i i i i i i i i i i i i i i
mutated. i
Mutation Point i
Offspring 1010010010
i i i i i i i i i i i i i i i i i i i i i i i i i i (3) i i i i i i i i i i i i i i i i i i
Mutation Operator i 1. Sort the A, B, and C function values. Assume if(C) <
i i i i i i i i i i i
population.
i must be replaced. In this case, a reflection is made in
i i i i i i i i i i i
Step V [Test]: If the end condition is satisfied, return the i i i i i i i i i i or J with r for A, depending on which function value is
i i i i i i i i i i i i
Step VI [Loop]: Go to step II. The Flowchart of Simple i i i i i i i i i i 3. If f(E)>f(C), there is a contraction to point G or H as a
i i i i i i i i i i i i i
i i i i i i ii i i i ii i i i ii i i i ii i i i ii i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i Nelder-Mead Algorithm: i either f(G) or f(H) is greater than f(C), the contraction
i i i i i i i i i i
step 1.
i i
PSO Algorithm:
i i i ii i i i ii i i i ii i i i ii i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i ii i i i i i i i i ii i i i
nature.
i i
i i i i i i i i i i
particle.
i
i Fig.1. NM Dual-dimensional case algorithm i i i i i hyperspace while updating their own velocity, which is i i i i i i i
i i i i i i ii i i i ii i i i ii i i i ii i i i ii i iiiiiii
i
i i
Experimental result I
i distributions that these items of clusters and data are i i i i i i i i i performance has been received. That compares to i i i i i i
i important to. Iris is used to set up a good comparison i i i i i i i i i i i other clustering algorithms. K-mean algorithm in
i i i i i
i and algorithm for data sets. In this data set (n=150, d=4,
i i i i i i i i i i i some cases there are problems. Just as in the beginning,
i i i i i i i i i
i k=3) it has three equal squares of 50 squares. In this data i i i i i i i i i i i i there may be a set of solutions for the K-GA matching
i i i i i i i i i i
i class iris Flowers, in which four-digit properties are i i i i i i i i solutions. So, we are using the PSO algorithm. With the i i i i i i i i i
i also included. These data sets are such that the length of
i i i i i i i i i i i help of algorithms, it helps to maintain the integrity of
i i i i i i i i i
III. PERFORMANCE IMEASURE i the NM algorithm is dependent on the starting point and
i i i i i i i i i
value +PSO
M+PSO
K=1 41.0214 43.1249 42.2547 43.5684 40.2547
4
x 10 Objective space Objective space
18
Proposed 450 Proposed
16 K-mean K-mean
GA 400 GA
14 NM NM
350
Intra Cluster Distance
Increase in efficiency
PSO PSO
12
300
10
250
8
200
6 150
4 100
2 50
0 0
0 1 2 3 0 1 2 3
10 10 10 10 10 10 10 10
Iterations No. of Clusters
Table 2 & fig 3 show the efficiency comparison. i i i i i i i i start with the combination of KM-GA to overcome its
i i i i i i i i i
babies. But still there is not a good start with GA, a good
i i i i i i i i i i i i i
2012
(coded as GA-KM) based on a genetic algorithm (GA)
i i i i i i i i i
Company, Boston.
algorithm overcomes k-means and GA's shortcomings
i i i i i i
http://dx.doi.org/10.1007/BF02823145
the proposed approach will combine the existing
i i i i i i i
235, 1446-1453.
combination of the KM-GA-NM-PSO with other
i i i i i i
http://dx.doi.org/10.1016/j.cam.2010.08.030
heuristic approaches and their application to data
i i i i i i i