Lower Bounds on Paraclique Density
Discrete Applied Mathematics
The scientific literature teems with clique-centric clustering strategies. In this paper we analyze one such method, the paraclique algorithm. Paraclique has found practical utility in a variety of application domains, and has been successfully employed to reduce the effects of noise. Nevertheless, its formal analysis and worst-case guarantees have remained elusive. We address this issue by deriving a series of lower bounds on paraclique densities.
Hagan, Ronald D., Michael A. Langston, Kai Wang.
"Lower Bounds on Paraclique Density."
Discrete Applied Mathematics, 204: 208-212.