TY - GEN
T1 - An efficient PSO-based clustering algorithm
AU - Tsai, Chun Wei
AU - Huang, Ko Wei
AU - Yang, Chu Sing
AU - Chiang, Ming Chao
PY - 2010/12/1
Y1 - 2010/12/1
N2 - Recently, particle swarm optimization (PSO) has become one of the most popular approaches to clustering problems because it can provide a higher quality result than deterministic local search method. The problem of PSO in solving clustering problems, however, is that it is much slower than deterministic local search method. This paper presents a novel method to speed up its performance for the partitional clustering problem-based on the idea of eliminating computations that are essentially redundant during its convergence process. In addition, the multistart strategy is used to improve the quality of the end result. To evaluate the performance of the proposed method, we compare it with several state-of-the-art methods in solving the data and image clustering problems. Our simulation results indicate that the proposed method can reduce from about 60% up to 90% of the computation time of the &-means and PSO-based algorithms to find similar or even better results.
AB - Recently, particle swarm optimization (PSO) has become one of the most popular approaches to clustering problems because it can provide a higher quality result than deterministic local search method. The problem of PSO in solving clustering problems, however, is that it is much slower than deterministic local search method. This paper presents a novel method to speed up its performance for the partitional clustering problem-based on the idea of eliminating computations that are essentially redundant during its convergence process. In addition, the multistart strategy is used to improve the quality of the end result. To evaluate the performance of the proposed method, we compare it with several state-of-the-art methods in solving the data and image clustering problems. Our simulation results indicate that the proposed method can reduce from about 60% up to 90% of the computation time of the &-means and PSO-based algorithms to find similar or even better results.
UR - http://www.scopus.com/inward/record.url?scp=78651443897&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78651443897&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:78651443897
SN - 9789898425287
T3 - KDIR 2010 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval
SP - 150
EP - 155
BT - KDIR 2010 - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval
T2 - International Conference on Knowledge Discovery and Information Retrieval, KDIR 2010
Y2 - 25 October 2010 through 28 October 2010
ER -