Skip to main content
SpringerLink
Log in

Adaptive Ant Clustering Algorithm with Pheromone

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9622))

Included in the following conference series:

  • 1530 Accesses

Abstract

In the midst of data mining tasks, clustering algorithms received special attention, especially when these techniques are bio-inspired and while they use special methods which improve a learning process during clusterization. Most promising among them are ant-based approaches. The process of clustering with colony of virtual ants is emerging and can be an alternative, when the data is complicated. Clustering, based on ant’s behavior, was first introduced by Deneubourg et al. in 1991 and this classical proposition still requires investigation to improve stability, scalability and convergence of speed. This investigations will show that we can create a mature tool for clustering. The aim of this research was to examine the execution of a new Ant Clustering Algorithm with a modified scheme of ants’ perception and an incorporation of pheromone matrices. To assess the performance of our proposition, certain amount of widely known benchmark data sets were used. Empirical study of our approach shows that the adACA performs well when the pheromone matrices influence the behavior of clustering ants and leads to better results.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Bonabeau, E.: From classical models of morphogenesis to agent-based models of patern formation. Artif. Life 3, 191–209 (1997)

    Article  Google Scholar 

  2. Boryczka, U., Kozak, J.: Ant colony decision trees – a new method for constructing decision trees based on ant colony optimization. In: Pan, J.-S., Chen, S.-M., Nguyen, N.T. (eds.) ICCCI 2010, Part I. LNCS, vol. 6421, pp. 373–382. Springer, Heidelberg (2010)

    Google Scholar 

  3. Boryczka, U., Kozak, J.: Enhancing the effectiveness of ant colony decision tree algorithms by co-learning. Appl. Soft Comput. 30, 166–178 (2015)

    Article  Google Scholar 

  4. Bouckaert, R.R., Frank, E., Hall, M., Kirkby, R., Reutemann, P., Seewald, A., Scuse, D.: Weka manual for version 3-7-10. Nieznane czasopismo (2013)

    Google Scholar 

  5. Chen, Q., Mo, J.: Optimizing the ant clustering model based on k-means algorithm. In: Proceeding of the WRI World Congerss on Computer Science and Information Engineering, vol. 3, pp. 699–702 (2009)

    Google Scholar 

  6. Tsai, C.W., Tsai, C.-F., Wu, H.-C.: Acof: a novel data clustering approach for data mining in large data bases. J. Syst. Softw. 73(1), 133–145 (2004)

    Article  MathSciNet  Google Scholar 

  7. Chretien, L.: Organisation Spatiale du Materiel Provenant de L’excavation du nid chez Messor Barbarus et des Cadavres d’ouvrieres chez Lasius niger (Hymenopterae: Formicidae). Ph.D. thesis, Universite Libre dr Bruxelles (1996)

    Google Scholar 

  8. Chu, S.-C., Roddick, J.F., Su, C.-J.: Constrained ant colony optimization for data clustering. J. Artif. Intell., 534–543 (2004)

    Google Scholar 

  9. Deneubourg, J.-L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chretien, L.: The dynamics of collective sorting: robot-like ant and ant-like robot. In: Meyer, J.A., Wilson, S.W. (eds.) First Conference on Simulation of Adaptive Behavior. From Animals to Animats, pp. 356–365. MIT Press, Cambridge (1991)

    Google Scholar 

  10. Fernandes, C., Merelo, J.J., Mora, A.M., Ramos, V., Laredo, J.L.J.: Kohonants: a self-organizing algorithm for clustering and pattern classification. Artif. Life XI, 428–435 (2008)

    Google Scholar 

  11. Franks, N.R., Sendova-Franks, A.B.: Brood sorting by ants: distributing the workload over the work surface. Behav. Ecol. Sociobiol. 30, 109–123 (1992)

    Article  Google Scholar 

  12. Ghosh, A., Halder, A., Kothari, M., Ghosh, S.: Aggregation pheromone density based data clustering. Inf. Sci. 178(13), 2816–2831 (2008)

    Article  Google Scholar 

  13. Gutowitz, H.: Complexity — seeking ants. Unpublished report (1993)

    Google Scholar 

  14. Handl, J., Knowles, J., Dorigo, M.: Ant-based clustering: a comparative study of its relative performance with respect to k-means, average link and id-som. Technical report 24, IRIDIA, Universite Libre de Bruxelles, Belgium (2003)

    Google Scholar 

  15. Handl, J., Meyer, B.: Improved ant-based clustering and sorting in a document retrieval interface. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN VII. LNCS, vol. 2439, pp. 913–923. Springer, Heidelberg (2002)

    Google Scholar 

  16. Lumer, E., Faieta, B.: Diversity and adaptation in populations of clustering ants. In: Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, pp. 489–508. MIT Press, Cambridge (1994)

    Google Scholar 

  17. Ngenkaew, W., Ono, S., Nakayamo, S.: Multiple pheromone deposition in ant-based clustering as an ant foraging concept. In: Proceedings of the IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2004, pp. 268–275. IEEE (2004)

    Google Scholar 

  18. Oprisan, S.A., Holban, V., Moldoveanu, B.: Functional self-organisation performing wide-sense stochastic processes. Phys. Lett. A 216, 303–306 (1996)

    Article  Google Scholar 

  19. Runkler, T.: Ant colony optimization of clustering model. Int. J. Intell. Syst. 20(12), 1233–1261 (2005)

    Article  MATH  Google Scholar 

  20. Sherafat, V., Nunes de Castro, L., Hruschka, E.R.: TermitAnt: an ant clustering algorithm improved by ideas from termite colonies. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds.) ICONIP 2004. LNCS, vol. 3316, pp. 1088–1093. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  21. Vizine, A., de Castro, L., Hruschka, E.: Towards improving clustering ants: Adaptive clustering algorithm. Inf. J. 29(2), 143–154 (2005)

    MATH  Google Scholar 

  22. Wang, F., Zhang, D., Bao, N.: Fuzzy document clustering based on ant colony algorithm. In: Yu, W., He, H., Zhang, N. (eds.) ISNN 2009, Part II. LNCS, vol. 5552, pp. 709–716. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Silesia, Sosnowiec, Poland

    Urszula Boryczka & Jan Kozak

Authors
  1. Urszula Boryczka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Kozak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Urszula Boryczka .

Editor information

Editors and Affiliations

  1. Wrocław University of Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. Wrocław University of Technology, Wrocław, Poland

    Bogdan Trawiński

  3. Iwate Prefectural University, Takizawa, Japan

    Hamido Fujita

  4. National University of Kaohsiung, Kaohsiung, Taiwan

    Tzung-Pei Hong

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boryczka, U., Kozak, J. (2016). Adaptive Ant Clustering Algorithm with Pheromone. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49390-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49389-2

  • Online ISBN: 978-3-662-49390-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation