A hierarchical ant based clustering algorithm and its use in three real-world applications - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2007

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

Résumé

In this paper is presented a new model for data clustering, which is inspired from the self-assembly 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.
Fichier non déposé

Dates et versions

hal-01020927 , version 1 (08-07-2014)

Identifiants

  • HAL Id : hal-01020927 , version 1

Citer

Hanene Azzag, Gilles Venturini, Antoine Olivier, Christiane Guinot. A hierarchical ant based clustering algorithm and its use in three real-world applications. European Journal of Operational Research, 2007, 179, pp.906-922. ⟨hal-01020927⟩
68 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More