The Research on Modified K-Means Algorithm Based on GA&SA
2013 ◽
Vol 347-350
◽
pp. 3242-3246
Keyword(s):
The traditional K-means clustering algorithm has the disadvantage of weakness in overall search, easily falling into local optimization, highly reliance on initial clustering center. Aiming at the drawback of falling into partial optimization, putting forward a modified K-means algorithm mixing GA and SA, which combined the advantages of global search ability of GA and local search, to avoid K-means algorithm to lost into local optimal solution. The results of simulation show that the performance of above-mentioned algorithm is better in the optimization capacity than before, and easier to get the global optimal solution. It is an effective algorithm.
2010 ◽
Vol 143-144
◽
pp. 389-393
2019 ◽
Vol 19
(2)
◽
pp. 139-145
◽
2013 ◽
Vol 756-759
◽
pp. 3231-3235
2013 ◽
Vol 339
◽
pp. 297-300
◽
2014 ◽
Vol 556-562
◽
pp. 3852-3855
◽
2012 ◽
Vol 182-183
◽
pp. 1681-1685
2014 ◽
Vol 687-691
◽
pp. 1548-1551
2012 ◽
Vol 591-593
◽
pp. 2441-2444
2011 ◽
Vol 268-270
◽
pp. 1184-1187
◽