A hierarchical ant based clustering algorithm and its use in three real-world applications

In this paper is presented a new model for data clustering, which is inspired from the selfassembly behavior of real ants. Real ants can build complex structures by connecting themselves to each others. It is shown is this paper that this behavior can be used to build a hierarchical tree-structured partitioning of the data according to the similarities between those data. Several algorithms have been detailed using this model (called AntTree): deterministic or stochastic algorithms that may use or not global or local thresholds. Those algorithms have been evaluated using artificial and real databases. Our algorithms obtain competitive results when compared to the Kmeans, to ANTCLASS, and to Ascending Hierarchical Clustering. AntTree has been applied to three real world applications: the analysis of human healthy skin, the on-line mining of web sites usage, and the automatic construction of portal sites.

• Type: Journal
• Year: 2007
• Where: EOR
• Authors: Hanene Azzag, Gilles Venturini, Antoine Oliver, Christiane Guinot
• Keywords: Algorithms, EOR 2007, Hierarchical Tree-structured Partitioning, Real Ants