A fast particle swarm optimization for clustering

doi:10.1007/s00500-014-1255-3

CNU IR > College of Smart Living > Dept. of Multimedia and Game Development > Periodical Articles > Item 310902800/29602

Please use this identifier to cite or link to this item: https://ir.cnu.edu.tw/handle/310902800/29602

Title:	A fast particle swarm optimization for clustering
Authors:	Tsai, Chun-Wei Huang, Ko-Wei Yang, Chu-Sing Chiang, Ming-Chao
Contributors:	資訊多媒體應用系
Keywords:	Clustering Particle swarm optimization Pattern reduction
Date:	2015-02
Issue Date:	2016-04-19 19:01:40 (UTC+8)
Publisher:	Springer
Abstract:	This paper presents a high-performance method to reduce the time complexity of particle swarm optimization (PSO) and its variants in solving the partitional clustering problem. The proposed method works by adding two additional operators to the PSO-based algorithms. The pattern reduction operator is aimed to reduce the computation time, by compressing at each iteration patterns that are unlikely to change the clusters to which they belong thereafter while the multistart operator is aimed to improve the quality of the clustering result, by enforcing the diversity of the population to prevent the proposed method from getting stuck in local optima. To evaluate the performance of the proposed method, we compare it with several state-of-the-art PSO-based methods in solving data clustering, image clustering, and codebook generation problems. Our simulation results indicate that not only can the proposed method significantly reduce the computation time of PSO-based algorithms, but it can also provide a clustering result that matches or outperforms the result PSO-based algorithms by themselves can provide.
Relation:	Soft Computing, v.19 n.2, pp.321-338
Appears in Collections:	[Dept. of Multimedia and Game Development] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	1867	View/Open

Loading...