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

一种用于约束相关聚类的更快算法

A Faster Algorithm for Constrained Correlation Clustering

Nick Fischer, Evangelos Kipouridis, Jonas Klausen, Mikkel Thorup

AI总结:

本文提出一种更组合化的约束相关聚类算法,以 \widetilde{O}(n^3) 时间实现 16-近似,并去随机化 CC-PIVOT、证明其枢轴顺序下界及节点加权版本的 3-近似。

摘要:

在 Correlation Clustering(相关聚类)问题中,给定 n 个节点,以及每对节点的一个偏好,用于表明我们是否偏好两个端点处于同一个簇中。输出是一个使被违反偏好数量最少的聚类。然而,在某些情况下,某些节点对之间的偏好可能过于重要而不能被违反。该问题的约束版本规定了必须处于同一簇中的节点对,以及必须不处于同一簇中的节点对(硬约束)。输出聚类必须满足所有硬约束,同时最小化被违反偏好的数量。Constrained Correlation Clustering(约束相关聚类)是 APX-Hard 的,van Zuylen 等人[SODA '07]已使用 Ω(n^{3ω}) 时间给出了因子 3 的近似。在本文中,我们采用更具组合性的方法,展示了如何以略弱的近似因子为代价,显著更快地近似该问题。具体而言,我们的算法运行时间为 \widetilde{O}(n^3),并以因子 16 近似 Constrained Correlation Clustering。为获得该结果,我们需要由(无约束)Correlation Clustering 的一个特定且有影响力的算法 CC-PIVOT 所保证的性质。该算法选择一个枢轴节点 u,创建一个包含 u 及其所有偏好节点的簇,并递归求解问题的其余部分。作为本文工作的副产品,我们给出了 CC-PIVOT 算法的一种去随机化,仍能达到 3-近似;此外,我们表明存在一些实例,在这些实例中,对于任意常数 ε,没有任何枢轴顺序能够给出 (3-ε)-近似。最后,我们引入了 Correlation Clustering 的节点加权版本,利用我们关于 Constrained Correlation Clustering 的洞见,该版本可以在因子 3 内被近似。

英文摘要:

In the Correlation Clustering problem we are given $n$ nodes, and a preference for each pair of nodes indicating whether we prefer the two endpoints to be in the same cluster or not. The output is a clustering inducing the minimum number of violated preferences. In certain cases, however, the preference between some pairs may be too important to be violated. The constrained version of this problem specifies pairs of nodes that must be in the same cluster as well as pairs that must not be in the same cluster (hard constraints). The output clustering has to satisfy all hard constraints while minimizing the number of violated preferences. Constrained Correlation Clustering is APX-Hard and has been approximated within a factor 3 by van Zuylen et al. [SODA '07] using $Ω(n^{3ω})$ time. In this work, using a more combinatorial approach, we show how to approximate this problem significantly faster at the cost of a slightly weaker approximation factor. In particular, our algorithm runs in $\widetilde{O}(n^3)$ time and approximates Constrained Correlation Clustering within a factor 16. To achieve our result we need properties guaranteed by a particular influential algorithm for (unconstrained) Correlation Clustering, the CC-PIVOT algorithm. This algorithm chooses a pivot node $u$, creates a cluster containing $u$ and all its preferred nodes, and recursively solves the rest of the problem. As a byproduct of our work, we provide a derandomization of the CC-PIVOT algorithm that still achieves the 3-approximation; furthermore, we show that there exist instances where no ordering of the pivots can give a $(3-\varepsilon)$-approximation, for any constant $\varepsilon$. Finally, we introduce a node-weighted version of Correlation Clustering, which can be approximated within factor 3 using our insights on Constrained Correlation Clustering.

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

↑