2006 | OriginalPaper | Buchkapitel
An ACO-Based Clustering Algorithm
verfasst von : Yucheng Kao, Kevin Cheng
Erschienen in: Ant Colony Optimization and Swarm Intelligence
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.