Hybrid genetic model for clustering ensemble

作者:

Highlights:

摘要

Clustering ensemble has received considerable research interest and led to a proliferation of studies, since it has great capabilities to combine multiple base clusters to generate a more robust and stable consensus result. Genetic algorithms are optimization methods which can search heuristically by simulating the natural evolution process with highly parallel and adaptive characteristics. However, to our knowledge, there are very few existing methods using a genetic model to solve clustering ensemble problems. In this paper, a novel hybrid genetic model for clustering ensemble (HGMCE) is proposed innovatively, and the corresponding objective function is designed. Each base clustering is regarded as a new attribute of data, and the result of clustering ensemble can be evaluated by the objective function. Then the proposed model can be inferred with the optimization, combination, and transcendence of base clustering results step by step, which makes it possible to maintain the diversity of the population and provides more possibilities to avoid falling into the local optimal solution. Furthermore, an algorithm named HGCEA corresponding to the proposed model is designed to solve the clustering ensemble problem. To evaluate the potential of HGCEA, extensive experiments are carried out on ten real datasets, including comparison with clustering groups and clustering ensemble groups. The results of accuracy and normalized mutual information demonstrate the superiority of the proposed algorithm in integrating effective clustering over the state-of-the-art.

论文关键词:Clustering,Clustering ensemble,Genetic algorithm,Hybrid genetic model

论文评审过程:Received 25 March 2021, Revised 24 August 2021, Accepted 29 August 2021, Available online 2 September 2021, Version of Record 7 September 2021.

论文官网地址:https://doi.org/10.1016/j.knosys.2021.107457