Article thumbnail

Constrained ant colony optimization for data clustering

By Shu-chuan Chu, Johnf. Roddick, Che-jen Su and Jeng-shyang Pan

Abstract

Abstract. Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heuristic algorithms include genetic algorithms, particle swarm optimization and ant colony systems and have received increasing attention in recent years. This paper extends ant colony systems and discusses a novel data clustering process using Constrained Ant Colony Optimization (CACO). The CACO algorithm extends the Ant Colony Optimization algorithm by accommodating a quadratic distance metric, the Sum of K Nearest Neighbor Distances (SKNND) metric, constrained addition of pheromone and a shrinking range strategy to improve data clustering. We show that the CACO algorithm can resolve the problems of clusters with arbitrary shapes, clusters with outliers and bridges between clusters.

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.332.8366
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://iiirc.hitsz.edu.cn/cour... (external link)
  • http://iiirc.hitsz.edu.cn/cour... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.