Professional Documents
Culture Documents
Mehdi Torshizi
I.
INTRODUCTION
another work [14], the PSO is used for the initial search, Kmeans used to reclaim the initial search results and multiclass
merging is used to achieve faster convergence and better search
functionality in clustering. Recently in [15] the combination of
Improved PSO, K-Means and Genetic Algorithm (GA) is
applied on clustering.
K-MEANS ALGORITHM
(4)
(1)
IV.
(3)
(2)
60
It should be noted that this process is not done for any new
position because this may cause repeated calculations. Also the
K-Means algorithm was not applied separately and integrated
in the PSO algorithm. The objective function in our clustering
algorithm, like K-Means, is the sum of the distances of all
samples from all cluster centers using Euclidean distance. The
feature vectors may be normalized with respect to the
maximum of range in the dimension.
V.
(5)
EXPERIMENTAL RESULTS
TABLE I.
Dataset
BS
BCW-O
CA
D
D-PID
E
GI
HD
HC
I
TD
W
The sizes of the training and the test sets are also mentioned
in Table I. We set the parameters of the PSO algorithm as: n =
50, = 1000, = 10% of the feature space width, =
- . To determine the parameters , and we used the
method of [20] that results = =1.4562 and w=0.7298. The
value of w is degraded by the coefficient 0.99 in each iteration.
We used the threshold of 0.00005 as minimum improvements
61
Total
625
699
690
366
768
336
214
303
368
150
215
178
ATTRIBUTES OF DATASETS.
Train
468
524
517
274
576
252
160
227
276
112
161
133
Test
157
175
173
92
192
84
54
76
92
38
54
45
Features
4
10
15
34
8
7
9
13
27
4
5
13
Category
3
2
2
6
2
8
6
5
2
3
3
3
TABLE II.
Dataset
IKPSO
PSO
BS
BCW-O
CA
D
D-PID
E
GI
HD
HC
I
TD
W
31.85
1.14
11.56
14.13
28.12
26.19
38.89
36.84
52.17
7.89
16.67
4.44
42.04
1.14
17.34
35.87
27.08
34.52
50
40.79
52.17
7.89
16.67
6.67
IKPSO
Iterations
64
60
57
65
58
72
69
69
59
59
62
62
PSO
Iterations
97
99
143
195
109
177
155
162
177
94
119
146
TABLE III.
RESULTS OF CLUSTERING AS CLASSIFICATION ERROR
PERCENTAGE WITHOUT NORMALIZING DATASETS.
K-Means
Dataset
IKPSO
PSO
30.57
1.14
53.76
35.87
29.17
22.62
44.44
39.87
48.26
7.89
17.78
4.44
BS
BCW-O
CA
D
D-PID
E
GI
HD
HC
I
TD
W
31.21
1.14
55.49
81.52
39.58
23.81
57.41
69.74
31.52
7.89
37.04
15.54
31.85
1.14
44.51
81.52
45.83
33.33
59.26
71.05
31.52
7.89
40.74
13.33
PSO
Iterations
95
106
158
224
138
143
153
196
199
133
113
136
K-Means
39.49
1.14
55.49
80.98
39.58
22.62
57.22
69.47
31.52
7.89
22.96
21.56
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
IKPSO
Iterations
74
61
64
103
59
65
75
79
63
61
62
55
[8]
[9]
[10]
[11]
COLLUSION
[12]
[13]
[14]
[15]
62
[16] Lichman
M.
UCI
Machine
Learning
Repository
[http://archive.ics.uci.edu/ml]. Irvine: 2013;
CA: University of
California, School of Information and Computer Science.
[17] Karaboga D, Ozturk C. A novel clustering approach: Artificial Bee
Colony (ABC) algorithm. Appl Soft Comput 2011;11:652-7.
[18] MacQueen JB. Some Methods for classification and Analysis of
Multivariate Observations. In: 5th Berkeley Symposium on Mamatical
Statistics and Probability: University of California Press; 1967. p. 281
97.
63