In this paper, we propose a hybridization between an ant-based clustering algorithm: CAC (Communicating Ants for Clustering) algorithm [5] and a clustering aggregation algorithm: the Furthest algorithm [6]. The CAC algorithm takes inspiration from the sound communication properties of real ants. In this algorithm, artificial ants communicate directly with each other in order to achieve the clustering task. The Furthest algorithm takes as inputs m clusterings given by m different runs of the CAC algorithm, and tries to find a clustering that matches, as possible, all the clusterings given as inputs. This hybridization shows an improvement of the obtained results. © 2011 Springer-Verlag.
CITATION STYLE
Elkamel, A., Gzara, M., & Ben-Abdallah, H. (2011). Clustering aggregation for improving ant based clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6728 LNCS, pp. 250–259). Springer Verlag. https://doi.org/10.1007/978-3-642-21515-5_30
Mendeley helps you to discover research relevant for your work.