2002 · 99 citations · 7 references
Open access
In this paper, we introduce a new method to solve the unsupervised clustering problem, based on a modelling of the chemical recognition system of ants. This system allow ants to discriminate between nestmates and intruders, and thus to create homogeneous groups of individuals sharing a similar odor by continuously exchanging chemical cues. This phenomenon, known as "colonial closure", inspired us into developing a new clustering algorithm and then comparing it to a well-known method such as K-MEANS method. Our results show that our algorithm performs better than K-MEANS over artificial and real data sets, and furthermore our approach requires less initial information (such as number of classes, shape of classes, limitation in the types of attributes handled).
7
Algorithms for Clustering Data
Warren S. Sarle, Anil K. Jain, Richard C. Dubes · Technometrics · 1990 · 7.8K citations
Distributed Optimization by Ant Colonies
Alberto Colorni, Marco Dorigo, Vittorio Maniezzo et al. · 1992 · 2.6K citations · Full text