Application of Parallel Annealing Particle Clustering Algorithm in Data Mining

With development of the computer technology, the large-scale calculation problems are often appeared in the network, it needs a lot of system resources and support of hardware, it often bring troubles in engineering optimization, so it needs apply the method such as the group's global optimization method and its improved algorithm to obtain reliable results in the computer system. In the study, it proposes a kind of particle swarm optimization based on parallel annealing parallel clustering algorithm, it is a new global optimization algorithm and it is especially suitable for continuous variable problem. In the engineering field, it can be used in large-scale computational problems, it is based on the method of group, and has parallelism abilty. In the parallel particle swarm optimization algorithm, the particle swarm can reduce the consumption of calculation time. The experimental results show that the Multipoint interface (MPI) communication used in annealing parallel particle swarm optimization algorithm not only can reduce the computing time of particle swarm, but also improve the clustering quality, stronger effectiveness algorithm is verfied. DOI : http://dx.doi.org/10.11591/telkomnika.v12i3.3973 Full Text: PDF

[1]  R. Eberhart,et al.  Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[2]  Andries Petrus Engelbrecht,et al.  Scalability of niche PSO , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[3]  P. J. Angeline,et al.  Using selection to improve particle swarm optimization , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[4]  Wu Xiaochao,et al.  Simulation of Radar Track Based on Data Mining Techniques , 2013 .

[5]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[6]  P. Suganthan.  Particle swarm optimiser with neighbourhood operator , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[7]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[8]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[9]  Andries Petrus Engelbrecht,et al.  Cooperative learning in neural networks using particle swarm optimizers , 2000, South Afr. Comput. J..

[10]  Bao-guo Wu,et al.  Multidimensional data mining using a K-mean algorithm based on the forest management inventory of Fujian Province, China , 2013 .

[11]  James Kennedy,et al.  The Behavior of Particles , 1998, Evolutionary Programming.

[12]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[13]  E. Ozcan,et al.  Particle swarm optimization: surfing the waves , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).