AN EFFICIENT PSO-BASED CLUSTERING ALGORITHM

Chun-Wei Tsai, Ko-Wei Huang, Chu-Sing Yang, Ming-Chao Chiang

2010

Abstract

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 k-means and PSO-based algorithms to find similar or even better results.

References

  1. Cohen, S. C. and de Castro, L. N. (2006). Data clustering with particle swarms. In Proceedings of IEEE Congress on Evolutionary Computation, pages 1792- 1798.
  2. Feng, H.-M., Chen, C.-Y., and Ye, F. (2007). Evolutionary fuzzy particle swarm optimization vector quantization learning scheme in image compression. Expert Systems with Applications, 32(1):213-222.
  3. Kennedy, J. and Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE International Conference on Neural Networks, volume 4, pages 1942- 1948.
  4. Kogan, J. (2007). Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press, New York, NY, USA.
  5. Larran˜aga, P. and Lozano, J. A., editors (2002). Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation (Genetic Algorithms and Evolutionary Computation). Springer, Norwell, MA, USA.
  6. McQueen, J. B. (1967). Some methods of classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, pages 281-297.
  7. Omran, M. G., Engelbrecht, A. P., and Salman, A. A. (2005). Particle swarm optimization method for image clustering. International Journal of Pattern Recognition and Artificial Intelligence, 19(3):297-321.
  8. Omran, M. G., Salman, A. A., and Engelbrecht, A. P. (2002). Image classification using particle swarm optimization. In Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pages 370-374.
  9. Paterlini, S. and Krink, T. (2006). Differential evolution and particle swarm optimisation in partitional clustering. Computational Statistics & Data Analysis, 50(5):1220-1247.
  10. Raghavan, V. and Birchand, K. (1979). A clustering strategy based on a formalism of the reproductive process in a natural system. In Proceedings of the Second International Conference on Information Storage and Retrieval, pages 10-22.
  11. Ratnaweera, A., Halgamuge, S. K., and Watson, H. C. (2004). Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation, 8(3):240-255.
  12. Tsai, C.-F., Tsai, C.-W., and Yang, T. (2002). A modified multiple-searching method to genetic algorithms for solving traveling salesman problem. In IEEE International Conference on Systems, Man and Cybernetics, volume 3.
  13. Tsai, C.-W., Yang, C.-S., and Chiang, M.-C. (2007). A time efficient pattern reduction algorithm for k-means based clustering. In IEEE International Conference on Systems, Man and Cybernetics, pages 504-509.
  14. Xiao, X., Dow, E. R., Eberhart, R., Miled, Z. B., and Oppelt, R. J. (2003). Gene clustering using self-organizing maps and particle swarm optimization. In Proceedings of the 17th International Symposium on Parallel and Distributed Processing, page 154.2.
  15. Xu, R. and Wunsch, D. C. (2008). Clustering. Wiley, John & Sons, Inc.
  16. Yang, C.-S., Chuang, L.-Y., Ke, C.-H., and Yang, C.- H. (2008). Comparative particle swarm optimization (cpso) for solving ptimization problems. In Proceedings of International Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies, pages 86-90.
Download


Paper Citation


in Harvard Style

Tsai C., Huang K., Yang C. and Chiang M. (2010). AN EFFICIENT PSO-BASED CLUSTERING ALGORITHM . In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2010) ISBN 978-989-8425-28-7, pages 150-155. DOI: 10.5220/0003055301500155


in Bibtex Style

@conference{kdir10,
author={Chun-Wei Tsai and Ko-Wei Huang and Chu-Sing Yang and Ming-Chao Chiang},
title={AN EFFICIENT PSO-BASED CLUSTERING ALGORITHM},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2010)},
year={2010},
pages={150-155},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003055301500155},
isbn={978-989-8425-28-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2010)
TI - AN EFFICIENT PSO-BASED CLUSTERING ALGORITHM
SN - 978-989-8425-28-7
AU - Tsai C.
AU - Huang K.
AU - Yang C.
AU - Chiang M.
PY - 2010
SP - 150
EP - 155
DO - 10.5220/0003055301500155