| Literature DB >> 27057077 |
Ronald D Hagan1, Michael A Langston1, Kai Wang1.
Abstract
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.Entities:
Keywords: clique; clustering; graph density; paraclique
Year: 2016 PMID: 27057077 PMCID: PMC4820293 DOI: 10.1016/j.dam.2015.11.010
Source DB: PubMed Journal: Discrete Appl Math ISSN: 0166-218X Impact factor: 1.139