Ant colony optimization of clustering models
International Journal of Intelligent Systems2005Vol. 20(12), pp. 1233–1251
Citations Over TimeTop 10% of 2005 papers
Abstract
The original ant system algorithm is simplified leading to a generalized ant colony optimization algorithm that can be used to solve a wide variety of discrete optimization problems. It is shown how objective function based clustering models such as hard and fuzzy c-means can be optimized using particular extensions of this simplified ant optimization algorithm. Experiments with artificial and real datasets show that ant clustering produces better results than alternating optimization because it is less sensitive to local extrema. © 2005 Wiley Periodicals, Inc. Int J Int Syst 20: 1233–1251, 2005.
Related Papers
- → Ant colony optimization for continuous domains(2006)1,369 cited
- A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends(2002)
- → Understanding the Pheromone System Within Ant Colony Optimization(2005)18 cited
- → CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization(2013)
- PARALLELIZATION STRATEGY FOR ANT COLONY OPTIMIZATION METAHEURISTIC(2016)