Management Science and Financial Engineering

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

A Stigmergy-and-Neighborhood Based Ant Algorithm for Clustering Data

  • Lee, Hee-Sang (Department of Systems Management Engineering Sungkyunkwan University) ;
  • Shim, Gyu-Seok (Department of Systems Management Engineering Sungkyunkwan University)
  • Published : 2009.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

Data mining, specially clustering is one of exciting research areas for ant based algorithms. Ant clustering algorithm, however, has many difficulties for resolving practical situations in clustering. We propose a new grid-based ant colony algorithm for clustering of data. The previous ant based clustering algorithms usually tried to find the clusters during picking up or dropping down process of the items of ants using some stigmergy information. In our ant clustering algorithm we try to make the ants reflect neighborhood information within the storage nests. We use two ant classes, search ants and labor ants. In the initial step of the proposed algorithm, the search ants try to guide the characteristics of the storage nests. Then the labor ants try to classify the items using the guide in-formation that has set by the search ants and the stigmergy information that has set by other labor ants. In this procedure the clustering decision of ants is quickly guided and keeping out of from the stagnated process. We experimented and compared our algorithm with other known algorithms for the known and statistically-made data. From these experiments we prove that the suggested ant mining algorithm found the clusters quickly and effectively comparing with a known ant clustering algorithm.

Keywords

References

  1. Dorigo, M. and G. Di Caro, The ant colony optimization metaheuristic, In Corne, D., Dorigo, M., and Glover, F., (Eds.), New Ideas in Optimization, (1999), 11-32, London, UK
  2. Bonabeau, E., M. Dorigo, and G. Theraulaz, Swarm Intelligence-From Natural to Artificial Systems, Oxford University Press, New York, NY, USA, 1999
  3. Dorigo, M., E. Bonabeau, and G. Theraulaz, 'Ant algorithms and stigmergy,' Future Generation Computer Systems 16, 8 (2000), 851-871 https://doi.org/10.1016/S0167-739X(00)00042-X
  4. Deneubourg, J.-L., S. Goss, N. Franks, A. Sendova-Franks, C. Detrain, and L. Chr'etien, The dynamics of collective sorting: Robot-like ants and ant-like robots, In Proceedings of the First International Conference on Simulation of Adaptive Behaviour: From Animals to Animats 1 (1991), 356-365, Cambridge, MA, MIT Press
  5. Lumer, E. and B. Faieta, Diversity and adaptation in populations of clustering ants, In Proceedings of the Third International Conference on Simulation of Adaptive Bhaviour: From Animals to Animats 3 (1994), 501-508, Cambridge, MA, MIT Press
  6. Kuntz, P., P. Layzell, D. Snyder, A colony of ant-like agents for partitioning in VLSI technology, in P. Husbands, I. Harvey (Eds.), Proceedings of the Fourth European Conference on Artificial Life, (1997), 412-424, MIT Press, Cambridge, MA
  7. Handl, J. and B. Meyer, Improved ant-based clustering and sorting in a document retrieval interface, PPSN VII, LNCS 2439, 2002
  8. Handl, J., J. Knowles, and M. Dorigo, Strategies for the increased robustness of antbased clustering, In Engineering Self-Organising Systems, Lecture Notes in Computer Science, 2977 (2004), 90-104, Heidelberg, Germany: Springer-Verlag
  9. Handl, J., J. Knowles, and M. Dorigo, Ant-based Clustering and Topographic Mapping, Artificial Life, 12, 1 (2004) https://doi.org/10.1162/106454606775186400
  10. N. Labroche, N. Monmarch'e, and G. Venturini, A new clustering algorithm based on the chemical recognition system of ants, in Proc. ECAI-02, Lyon FRANCE, (2002), 345-349
  11. Labroche, N., C. Guinot, and G. Venturini, Fast Unsupervised Clustering with Artificial Ants, PPSN VIII, LNCS 3242, (2004), 1143-1152