Lower Bounds on Paraclique Density.
Discrete Appl Math
; 204: 208-212, 2016 May 11.
Article
em En
| MEDLINE
| ID: mdl-27057077
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.
Texto completo:
1
Base de dados:
MEDLINE
Idioma:
En
Ano de publicação:
2016
Tipo de documento:
Article