Treffer: An Improved Particle Swarm Optimization for Data Clustering.

Title:
An Improved Particle Swarm Optimization for Data Clustering.
Authors:
Li-Yeh Chuang1 chuang@isu.edu.tw, Yu-Da Lin2 e0955767257@yahoo.com.tw, Cheng-Hong Yang3,4,5 chyang@cc.kuas.edu.tw
Source:
Proceedings of the International MultiConference of Engineers & Computer Scientists 2012 Volume I. 2012, Vol. 1, p381-386. 6p.
Database:
Supplemental Index

Weitere Informationen

In recent years, clustering is still a popular analysis tool for data statistics. The data structure identifying from the large-scale data has become a very important issue in the data mining problem. In this paper, an improved particle swarm optimization based on Gauss chaotic map for clustering is proposed. Gauss chaotic map adopts a random sequence with a random starting point as a parameter, and relies on this parameter to update the positions and velocities of the particles. It provides the significant chaos distribution to balance the exploration and exploitation capability for search process. This easy and fast function generates a random seed processes, and further improve the performance of PSO due to their unpredictability. In the experiments, the eight different clustering algorithms were extensively compared on six test data. The results indicate that the performance of our proposed method is significantly better than the performance of other algorithms for data clustering problem. [ABSTRACT FROM AUTHOR]