A novel ant clustering algorithm based on cellular automata

  • Authors:

  • Xiaohua Xu;Ling Chen;Ping He

  • Affiliations:

  • (Correspd. E-mail: arterx@gmail.com) Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China;Department of Computer Science, Yangzhou University, Yangzhou 225009, China and National Key Lab of Novel Software Technology, Nanjing University, Nanjing 210000, China;Department of Computer Science, Yangzhou University, Yangzhou 225009, China

  • Venue:
  • Web Intelligence and Agent Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Based on the cellular automata in artificial life, an artificial Ants Sleeping Model (ASM) and an ant algorithm for cluster analysis (A$^4$C) are presented. By simulating the swarm intelligence of the real ant colonies, we use the ant agent to represent the 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 to become active. The state of an ant is determined only by its local information. By moving dynamically, the ants form different subgroups adaptively, and consequently the data objects they represent are clustered. Experimental results show that the A$^4$C algorithm on ASM is significantly superior to other clustering methods in terms of both speed and quality. It is adaptive, robust and efficient.