New heuristics for the Bicluster Editing Problem

• Published in: Annals of operations research 2017-11, Vol.258 (2), p.781-814
• Main Authors: de Sousa Filho, Gilberto F., Júnior, Teobaldo L. Bulhões, Cabral, Lucidio A. F., Ochi, Luiz Satoru, Protti, Fábio
• Format: Article
• Language: English
• Subjects: Business and Management; Combinatorics; Computing time; Data mining; Data structures; Editing; Empirical analysis; Gene expression; Graph theory; Graphs; Heuristic; Heuristic methods; Job shops; Mathematical analysis; Methods; Operations research; Operations Research/Decision Theory; Reduction; S.i.: Claio 2014; Studies; Theory of Computation
• ISSN: 0254-5330; 1572-9338
• DOI: 10.1007/s10479-016-2261-x

The NP-hard Bicluster Editing Problem (BEP) consists of editing a minimum number of edges of an input bipartite graph G in order to transform it into a vertex-disjoint union of complete bipartite subgraphs. Editing an edge consists of either adding it to the graph or deleting it from the graph. Applications of the BEP include data mining and analysis of gene expression data. In this work, we generate and analyze random bipartite instances for the BEP to perform empirical tests. A new reduction rule for the problem is proposed, based on the concept of critical independent sets, providing an effective reduction in the size of the instances. We also propose a set of heuristics using concepts of the metaheuristics ILS, VNS, and GRASP, including a constructive heuristic based on analyzing vertex neighborhoods, three local search procedures, and an auxiliary data structure to speed up the local search. Computational experiments show that our heuristics outperform other methods from the literature with respect to both solution quality and computational time.