arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1809.09493cs.CCcs.DS
收藏

广义相关聚类

Correlation Clustering Generalized

David F. Gleich, Nate Veldt, Anthony Wirth

摘要:

我们提出了新的结果LambdaCC和MotifCC,最近推出的两个变种的研究相关聚类问题。这两种变体的动机是网络分析和社区发现的应用,并具有非平凡的近似算法。我们首先表明,标准的线性规划松弛的LambdaCC有一个$Θ(\log n)$完整性的差距为一定的选择的参数$λ$。这揭示了以前的挑战,在获得参数无关的近似结果的LambdaCC。我们概括了以前的常数因子算法提供最好的结果,从LP舍入的方法,为扩展范围的$λ$。MotifCC将相关聚类推广到超图设置。在权值满足概率约束的度超边为$3$的情况下,将最佳逼近因子从$9$改进为$8$ .我们表明,在一般情况下,我们的算法给出了一个$4(k-1)$近似时,超边有最大程度的$k$和概率权重。我们还提出了LambdaCC和MotifCC的近似结果,我们限制只形成两个集群。

英文摘要:

We present new results for LambdaCC and MotifCC, two recently introduced variants of the well-studied correlation clustering problem. Both variants are motivated by applications to network analysis and community detection, and have non-trivial approximation algorithms. We first show that the standard linear programming relaxation of LambdaCC has a $Θ(\log n)$ integrality gap for a certain choice of the parameter $λ$. This sheds light on previous challenges encountered in obtaining parameter-independent approximation results for LambdaCC. We generalize a previous constant-factor algorithm to provide the best results, from the LP-rounding approach, for an extended range of $λ$. MotifCC generalizes correlation clustering to the hypergraph setting. In the case of hyperedges of degree $3$ with weights satisfying probability constraints, we improve the best approximation factor from $9$ to $8$. We show that in general our algorithm gives a $4(k-1)$ approximation when hyperedges have maximum degree $k$ and probability weights. We additionally present approximation results for LambdaCC and MotifCC where we restrict to forming only two clusters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑