New heuristics for the Bicluster Editing Problem

Gilberto F. Sousa Filho (), Teobaldo L. Bulhões Júnior (), Lucidio A. F. Cabral (), Luiz Satoru Ochi () and Fábio Protti ()
Additional contact information
Gilberto F. Sousa Filho: Universidade Federal da Paraíba (UFPB)
Teobaldo L. Bulhões Júnior: Universidade Federal da Paraíba (UFPB)
Lucidio A. F. Cabral: Universidade Federal da Paraíba (UFPB)
Luiz Satoru Ochi: Universidade Federal Fluminense (UFF)
Fábio Protti: Universidade Federal Fluminense (UFF)

Annals of Operations Research, 2017, vol. 258, issue 2, No 26, 814 pages

Abstract: Abstract 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.

Keywords: Bicluster Editing Problem; Metaheuristic; Clustering problem (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-016-2261-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:258:y:2017:i:2:d:10.1007_s10479-016-2261-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-016-2261-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().