Skip to main content

Abstract

We propose a clustering algorithm using particle swarm optimization (PSO) for partitioning a set of objects in K clusters, by defining a familiy of agents-partitions, each agent is defined by K centroids in a p-dimensional space; a centroid has an associated cluster, which is defined by the allocation of the objects to the nearest centroid. The agents move in the space according to PSO principles, that is, they move with random intensity in the direction of a vector called velocity, which results from the random sum of the best past position of this agent, the best overall agent, and the last direction. We compare the performance of the method with other heuristics also proposed by the authors, and with two classical methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • CASTILLO, W. and TREJOS, J. (2002): Two-mode partitioning: review of methods and application of tabu search. In: K. Jajuga, A. Sokolowski and H.H. Bock (Eds.): Classification, Clustering and Data Analysis. Springer, Berlin: 43–51.

    Google Scholar 

  • CLERC, M. (1998): Some math about particle swarm optimization, internet document at http://clerc.maurice.free.fr/pso/

    Google Scholar 

  • DIDAY, E., LEMAIRE, J., POUGET, J. and TESTU, F. (1982): Eléments d’Analyse des Données. Dunod, Paris.

    Google Scholar 

  • GODDARD, J., DE LOS COBOS, S., PIZA, E. and TREJOS, J. (2002): Clasificación de datos numéricos mediante optimización por enjambres de partículas. In: 5th International Conference on Operations Research, La Habana, Cuba, 4–8 March 2002.

    Google Scholar 

  • GROENEN, P.J.F., MATHAR, R. and TREJOS, J. (2000): Global optimization methods for multidimensional scaling applied to mobile communications. In: W. Gaul, O. Opitz and M. Schader (Eds.): Data Analysis. Scientific Modeling and Practical Application. Springer, Berlin, 459–469.

    Google Scholar 

  • KENNEDY, J. and EBERHART, R.C. (2000): Intelligent Swarm Systems. Academic Press, New York.

    Google Scholar 

  • PACHECO, A., MURILLO, A., PIZA, E. and TREJOS, J. (2004): Evaluación de heurísticas de optimización combintoria en clasificación por particiones. In: II Congreso Andino de Investigación de Operaciones, Cartagena, Colombia, 14–19 Mar 2004.

    Google Scholar 

  • PIZA, E., TREJOS, J. and MURILLO, A. (2000): Clustering with non-Euclidean distances using combinatorial optimisation techniques. In: J. Blasius, J. Hox, E. de Leeuw and P. Schmidt (Eds.): Science Methodology in the New Millenium, CD-Rom paper Nr. P090504, ISBN 90-801073-8-7.

    Google Scholar 

  • TREJOS, J. (1993): A simulated annealing implementation for oblique varimax rotations. In: J. Janssen and C. H. Skiadas (Eds.): Applied Stochastic Models and Data Analysis, Vol. II. World Scientific, Singapur, 981–989.

    Google Scholar 

  • TREJOS, J., MURILLO, A. and PIZA, E. (1998): Global stochastic optimization for partitioning. In: A. Rizzi, M. Vichi and H.H. Bock (Eds.): Advances in Data Science and Classification. Springer, Berlin, 185–190.

    Google Scholar 

  • TREJOS, J., MURILLO, A. and PIZA, E. (2004): Clustering by ant colony optimization. In: D. Banks, L. House, F.R. McMorris, P. Arabie and W. Gaul (Eds.): Classification, Clustering, and Data Mining Applications. Springer, Berlin, 25–32.

    Google Scholar 

  • TREJOS, J. and CASTILLO, W. (2000): Simulated annealing optimization for two-mode partitioning, In: W. Gaul and R. Decker (Eds.): Classification and Information at the Turn of the Millenium. Springer, Berlin, 133–142.

    Google Scholar 

  • TREJOS, J.; CASTILLO, W., GONZÁLEZ, J. and VILLALOBOS, M. (2000): Application of simulated annealing in some multidimensional scaling problems. In: H.A.L. Kiers, J.-P. Rasson, P.J.F. Groenen and M. Schader (Eds.): Data Analysis, Classification and Related Methods. Springer, Berlin, 297–302.

    Google Scholar 

  • VILLALOBOS, M., TREJOS, J. and DE LOS COBOS, S. (2006): Aplicación de la búsqueda tabú en regresión no lineal. Revista de Matemática: Teoría y Aplicaciones 13(1), 79–92.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Trejos-Zelaya, J., Villalobos-Arias, M. (2007). Partitioning by Particle Swarm Optimization. In: Brito, P., Cucumel, G., Bertrand, P., de Carvalho, F. (eds) Selected Contributions in Data Analysis and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73560-1_22

Download citation

Publish with us

Policies and ethics