Format

Send to

Choose Destination
Discrete Appl Math. 2016 May 11;204:208-212.

Lower Bounds on Paraclique Density.

Author information

1
Department of Electrical Engineering and Computer Science, University of Tennessee, Knoxville, TN, USA, 37996.

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.

KEYWORDS:

clique; clustering; graph density; paraclique

Supplemental Content

Full text links

Icon for PubMed Central
Loading ...
Support Center