Skip to main content

AntClust: Ant Clustering and Web Usage Mining

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Included in the following conference series:

Abstract

In this paper, we propose a new ant-based clustering algorithm called AntClust. It is inspired from the chemical recognition system of ants. In this system, the continuous interactions between the nestmates generate a “Gestalt” colonial odor. Similarly, our clustering algorithm associates an object of the data set to the odor of an ant and then simulates meetings between ants. At the end, artificial ants that share a similar odor are grouped in the same nest, which provides the expected partition. We compare AntClust to the K-Means method and to the AntClass algorithm. We present new results on artificial and real data sets. We show that AntClust performs well and can extract meaningful knowledge from real Web sessions.

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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

  1. Y. Chiou and L. W. Lan, “Genetic clustering algorithms,” European journal of Operational Research, no. 135, pp. 413–427, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  2. L. Y. Tseng and S. B. Yang, “Genetic clustering algorithms,” European journal of Operational Research, no. 135, pp. 413–427, 2001.

    Article  MathSciNet  Google Scholar 

  3. N. Monmarché, G. Venturini, and M. Slimane, “On how Pachycondyla apicalis ants suggest a new search algorithm,” Future Generation Computer Systems, vol. 16, no. 8, pp. 937–946, 2000.

    Article  Google Scholar 

  4. A. Colorni, M. Dorigo, and V. Maniezzo, “Distributed optimization by ant colonies,” in Proceedings of the First European Conference on Artificial Life (F. Varela and P. Bourgine, eds.), pp. 134–142, MIT Press, Cambridge, Massachusetts, 1991.

    Google Scholar 

  5. E. Lumer and B. Faieta, “Diversity and adaptation in populations of clustering ants,” in P. Husbands, J. Meyer, and S. W., eds., Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, MIT Press, Cambridge, Massachusetts, 1994 Cliff et al. [15], pp. 501–508.

    Google Scholar 

  6. P. Kuntz and D. Snyers, “Emergent colonization and graph partitioning,” in P. Husbands, J. Meyer, and S. W., eds., Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, MIT Press, Cambridge, Massachusetts, 1994 Cliff et al. [15], pp. 494–500.

    Google Scholar 

  7. N. Monmarché, M. Slimane, and G. Venturini, “On improving clustering in numerical databases with artificial ants,” in Lecture Notes in Artificial Intelligence (D. Floreano, J. Nicoud, and F. Mondala, eds.), (Swiss Federal Institute of Technology, Lausanne, Switzerland), pp. 626–635, Springer-Verlag, 13–17 September 1999.

    Google Scholar 

  8. N. Labroche, N. Monmarché, and G. Venturini, “A new clustering algorithm based on the chemical recognition system of ants,” in Proc. of 15th European Conference on Artificial Intelligence (ECAI 2002), Lyon FRANCE, pp. 345–349, 2002.

    Google Scholar 

  9. B. Hölldobler and E. Wilson, The Ants. Springer Verlag, Berlin, Germany, 1990.

    Google Scholar 

  10. N. Carlin and B. Hölldobler, “The kin recognition system of carpenter ants(camponotus spp.). i. hierarchical cues in small colonies,” Behav Ecol Sociobiol, vol. 19, pp. 123–134, 1986.

    Article  Google Scholar 

  11. J. Heer and E. Chi, “Mining the structure of user activity using cluster stability,” in Proceedings of the Workshop on Web Analytics, SIAM Conference on Data Mining (Arlington VA, April 2002)., 2002.

    Google Scholar 

  12. T. Yan, M. Jacobsen, H. Garcia-Molina, and U. Dayal, “From user access patterns to dynamic hypertext linking,” in Proc. of 5th WWW, pp. 1007–1014, 1996.

    Google Scholar 

  13. J. Heer and E. Chi, “Identification of web user traffic composition using multimodal clustering and information scent,” 2001.

    Google Scholar 

  14. V. Estivill-Castro and J. Yang, “Categorizing visitors dynamically by fast and robust clustering of access logs,” Lecture Notes in Computer Science, vol. 2198, pp. 498–509, 2001.

    Google Scholar 

  15. D. Cliff, P. Husbands, J. Meyer, and S. W., eds., Third International Conference on Simulation of Adaptive Behavior: From Animals to Animats 3, MIT Press, Cambridge, Massachusetts, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Labroche, N., Monmarché, N., Venturini, G. (2003). AntClust: Ant Clustering and Web Usage Mining. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics