An ACO-based clustering algorithm

  • Authors:
  • Yucheng Kao;Kevin Cheng

  • Affiliations:
  • Tatung University, Taipei, Taiwan;Tatung University, Taipei, Taiwan

  • Venue:
  • ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data clustering is one of important research topics of data mining. In this paper, we propose a new clustering algorithm based on ant colony optimization, called Ant Colony Optimization for Clustering (ACOC). At the core of the algorithm we use both the accumulated pheromone and the heuristic information, the distances between data objects and cluster centers of ants, to guide artificial ants to group data objects into proper clusters. This allows the algorithm to perform the clustering process more effectively and efficiently. Due to the nature of stochastic and population-based search, the ACOC can overcome the drawbacks of traditional clustering methods that easily converge to local optima. Experimental results show that the ACOC can find relatively good solutions.