How to use ants for data stream clustering

We present in this paper a new bio-inspired algorithm that dynamically creates groups of data. This algorithm is based on the concept of artificial ants that move together in a complex manner with simple localization rules. Each ant represents one datum in the algorithm. The moves of ants aim at creating homogeneous groups of data that evolve together in a graph environment. We also suggest an extension to this algorithm to treat data streaming. The extended algorithm has been tested on real-world data. Our algorithms yielded competitive results as compared to K-means and Ascending Hierarchical Clustering (AHC), two well known methods.