An ACO-Based Clustering Algorithm
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.
KeywordsCluster Center Data Object Heuristic Information Memory List Initial Cluster Center
Unable to display preview. Download preview PDF.
- 1.Han, J., Kamber, M.: Data mining: Concepts and Techniques. Morgan Kaufmann Publisher, San Francisco (2001)Google Scholar
- 5.Deneubourg, J.L., Goss, S., Franks, N., Sendova-Franks, A., Detrain, C., Chretien, L.: The dynamics of collective sorting robot-like ants and ant-like robots. In: Proc. Of the 1st Conf. on Sim. of Adaptive Behavior, pp. 356–363 (1991)Google Scholar
- 12.UCI Repository of Machine Learning Databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html