A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Convex Formulation for Planted Quasi-Clique Recovery
[article]
2021
arXiv
pre-print
Preserved Fulltext
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
arXiv:2109.08902v1
fatcat:atrpuikipfa5pktcgts75kfcba