2019

Conférence

In 2019 IEEE Congress on Evolutionary Computation (CEC) (pp. 2323-2330). IEEE

Bi-clustering is one of the main tasks in data mining with several application domains. It consists in partitioning a data set based on both rows and columns simultaneously. One of the main difficulties in bi-clustering is the issue of finding the number of bi-clusters, which is usually a user-specified parameter. Recently, in 2017, a new multi-objective evolutionary clustering algorithm, called MOCK-II, has shown its effectiveness in data clustering while automatically determining the number of clusters. Motivated by the promising results of MOCK-II, we propose in this paper a hybrid extension of this algorithm for the case of bi-clustering. Our new algorithm, called MOBICK, uses an efficient solution encoding, an effective crossover operator, and a heuristic mutation strategy. Similarly to MOCK-II, MOBICK is able to find automatically the number of bi-clusters. The outperformance of our algorithm is shown on a set of real gene expression data sets against several existing state-of-the-art works. Moreover, to be able to compare MOBICK to MOCK-I and MOCK-II, we have designed two basic extensions of MOCK-I and MOCK-II for the case of bi-clustering that we named B-MOCK-I and B-MOCK-II. Again, the experimental results confirm the merits of our proposal.

@inproceedings{bechikh2019hybrid,
  title={A Hybrid Evolutionary Algorithm with Heuristic Mutation for Multi-objective Bi-clustering},
  author={Bechikh, Slim and Elarbi, Maha and Hung, Chih-Cheng and Hamdi, Sabrine and Said, Lamjed Ben},
  booktitle={2019 IEEE Congress on Evolutionary Computation (CEC)},
  pages={2323--2330},
  year={2019},
  organization={IEEE}
}