Convex Formulation for Planted Quasi-Clique Recovery [article]

Sakirudeen A. Abdulsalaam, M. Montaz Ali
2021 arXiv   pre-print
In this paper, we consider the planted quasi-clique or γ-clique problem. This problem is an extension of the well known planted clique problem which is NP-hard. The maximum quasi-clique problem is applicable in community detection, information retrieval and biology. We propose a convex formulation using nuclear norm minimization for planted quasi-clique recovery. We carry out numerical experiments using our convex formulation and the existing mixed integer programming formulations. Results show
more » ... that the convex formulation performs better than the mixed integer formulations when γ is greater than a particular threshold.
arXiv:2109.08902v1 fatcat:atrpuikipfa5pktcgts75kfcba