Title :
Data Streams Clustering Algorithm Based on Grid and Particle Swarm Optimization
Author :
Ke, Luo ; Lin, Wang
Author_Institution :
Sch. of Comput. & Commun. Eng., Changsha Univ. of Sci. & Technol., Changsha, China
Abstract :
The offline components of CluStream clustering algorithm based on distance, and it is difficult to find non-spherical character of the cluster. This paper proposes a data streams clustering algorithm based on grid and particle swarm optimization, the algorithm based on two-tier structure of CluStream clustering algorithm. The grid feature vector to represent a snapshot, the grid density, and grid merging technologies is applied in this algorithm. So we can found any non-spherical clusters, In this algorithm. Non-dense grid is periodic and dynamic way to remove, which is good for reducing the space complexity. Using the PSO optimized clustering results in the offline components, in order to get a more precise clustering efficiency. Experiments show that this algorithm is more efficient than the CluStream algorithms, it has a good number of dimensions scalability, and it can find non-spherical nature of the clustering results.
Keywords :
computational complexity; particle swarm optimisation; pattern clustering; CluStream clustering algorithm; data streams clustering algorithm; grid density; grid feature vector; grid merging; particle swarm optimization; space complexity; Algorithm design and analysis; Application software; Attenuation; Clustering algorithms; Computer applications; Data engineering; Grid computing; Merging; Particle swarm optimization; Space technology; Clustering Algorithm; Data Stream; Grid density; Particle Swarm Optimization;
Conference_Titel :
Computer Science-Technology and Applications, 2009. IFCSTA '09. International Forum on
Conference_Location :
Chongqing
Print_ISBN :
978-0-7695-3930-0
Electronic_ISBN :
978-1-4244-5423-5
DOI :
10.1109/IFCSTA.2009.29