A clustering approach using cooperative artificial bee colony algorithm (Q607908): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58650814, #quickstatements; #temporary_batch_1704735187142 |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 07:52, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A clustering approach using cooperative artificial bee colony algorithm |
scientific article |
Statements
A clustering approach using cooperative artificial bee colony algorithm (English)
0 references
6 December 2010
0 references
Summary: Artificial Bee Colony (ABC) is one of the most recently introduced algorithms based on the intelligent foraging behavior of a honey bee swarm. This paper presents an extended ABC algorithm, namely, the Cooperative Article Bee Colony (CABC), which significantly improves the original ABC in solving complex optimization problems. Clustering is a popular data analysis and data mining technique; therefore, the CABC could be used for solving clustering problems. In this work, first the CABC algorithm is used for optimizing six widely used benchmark functions and the comparative results produced by ABC, Particle Swarm Optimization (PSO), and its cooperative version (CPSO) are studied. Second, the CABC algorithm is used for data clustering on several benchmark data sets. The performance of CABC algorithm is compared with PSO, CPSO, and ABC algorithms on clustering problems. The simulation results show that the proposed CABC outperforms the other three algorithms in terms of accuracy, robustness, and convergence speed.
0 references