Abstract
This paper proposes a data clustering algorithm that combines the steady-state genetic algorithm and the ensemble learning method, termed as genetic-guided clustering algorithm with ensemble learning operator (GCEL). GCEL adopts the steady-state genetic algorithm to perform the search task, but replaces its traditional recombination operator with an ensemble learning operator. Therefore, GCEL can avoid the problems of clustering invalidity and context insensitivity of the traditional recombination operator of genetic algorithms. In addition, GCEL generates its initial population of candidate clustering solutions by using the random subspaces method. Therefore, less fitness evaluations are required to converge. The proposed GCEL is tested on one synthetic and several real data sets. Experimental results demonstrate that GCEL is able to achieve a comparative or better clustering solution with less fitness evaluations when compared with several other existing genetic-guided clustering algorithms. © 2008 Elsevier B.V. All rights reserved.
Original language | English |
---|---|
Pages (from-to) | 1416-1423 |
Journal | Pattern Recognition Letters |
Volume | 29 |
Issue number | 9 |
DOIs | |
Publication status | Published - 1 Jul 2008 |
Externally published | Yes |
Funding
This paper was supported by the Project No. 7002073, City University of Hong Kong. The authors would like to thank the constructive comments from the reviewers.
Keywords
- Clustering analysis
- Ensemble learning
- Genetic-guided clustering algorithms