A MULTI-THREAD GRASP/VND FOR THE CLUSTER EDITING PROBLEM

The Cluster Editing problem is defined as follows: given as input an undirected loopless graph G = (V;E), by adding edges to G and/or removing edges from G, it must be transformed into a cluster graph, that is, an union of disjoint cliques. The Cluster Editing problem was proved to be NP-complete. This problem models several practical applications in the fields of image processing, computational biology and more. This work proposes a new multi-thread GRASP/VND algorithm to solve the problem heuristically, while a mathematical formulation of the problem is used to exactly solve it. Furthermore, a selective local search method is used to find the solution of very large instances within a reasonable computational time. Tests on benchmark instances showed that the proposed algorithm obtains optimum solutions, in many cases, or very close to optimum ones. Besides that, the computational times are very small in comparison with other techniques found in literature.

[1]  Roded Sharan,et al.  Cluster graph modification problems , 2002, Discret. Appl. Math..

[2]  Darren A. Natale,et al.  The COG database: an updated version includes eukaryotes , 2003, BMC Bioinformatics.

[3]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4]  Zohar Yakhini,et al.  Clustering gene expression patterns , 1999, J. Comput. Biol..

[5]  Sven Rahmann,et al.  Exact and heuristic algorithms for weighted cluster editing. , 2007, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

[6]  Panos M. Pardalos,et al.  A Parallel GRASP for MAX-SAT Problems , 1996, PARA.

[7]  Rolf Niedermeier,et al.  Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation , 2005, Theory of Computing Systems.

[8]  Yoshiko Wakabayashi,et al.  A cutting plane algorithm for a clustering problem , 1989, Math. Program..

[9]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[10]  Ron Shamir,et al.  CLICK and EXPANDER: a system for clustering and visualizing gene expression data , 2003, Bioinform..

[11]  U Aickelin,et al.  Handbook of metaheuristics (International series in operations research and management science) , 2005 .

[12]  A. Sen Gupta,et al.  On clique generation using Boolean equations , 1979, Proceedings of the IEEE.

[13]  Sebastian Böcker,et al.  Exact Algorithms for Cluster Editing: Evaluation and Experiments , 2008, Algorithmica.

[14]  Sebastian Böcker,et al.  Exact Algorithms for Cluster Editing: Evaluation and Experiments , 2008, WEA.

[15]  Yun Zhang,et al.  The Cluster Editing Problem: Implementations and Experiments , 2006, IWPEC.

[16]  Sven Rahmann,et al.  Large scale clustering of protein sequences with FORCE -A layout based heuristic for weighted cluster editing , 2007, BMC Bioinformatics.