A Novel Ant Clustering Algorithm Based on Cellular Automata

  • Authors:
  • Ling Chen;Xiaohua Xu;Yixin Chen;Ping He

  • Affiliations:
  • Yangzhou University, China/ Nanjing Univ., China;Yangzhou University, China;Univ. of Illinois at Urbana-Champaign, USA;Yangzhou University, China

  • Venue:
  • IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Based on the principle of cellular automata in artificial life, an artificial Ants Sleeping Model (ASM) and an ant algorithm for cluster analysis (A驴C) are presented. Inspired by the behaviors of gregarious ant colonies, we use the ant agent to represent data object. In ASM, each ant has two states: sleeping state and active state. The ant's state is controlled by a function of the ant's fitness to the environment it locates and a probability for the ants becoming active. The state of an ant is determined only by its local information. By moving dynamically, the ants form different subgroups adaptively, and hence the data objects they represent are clustered. Experimental results show that the A驴C algorithm on ASM is significantly better than other clustering methods in terms of both speed and quality. It is adaptive, robust and efficient, achieving high autonomy, simplicity and efficiency.