Lower Bounds on Paraclique Density.
Lower Bounds on Paraclique Density.
复制标题
DOI：
10.1016/j.dam.2015.11.010
复制
发表时间：
2016-05-11
期刊：
影响因子：
--
通讯作者：
Wang K
中科院分区：
文献类型：
--
作者：
Hagan RD;Langston MA;Wang K
科学文献中充斥着以派系为中心的聚类策略。在本文中，我们分析了一种这样的方法，即 paraclique 算法。 Paraclique 在各种应用领域都有实际用途，并已成功用于减少噪音的影响。然而，其正式分析和最坏情况的保证仍然难以捉摸。我们通过推导一系列旁系密度下限来解决这个问题。
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.