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

组合相关聚类

Combinatorial Correlation Clustering

Vincent Cohen-Addad, David Rasmussen Lolck, Marcin Pilipczuk, Mikkel Thorup, Shuyi Yan, Hanwen Zhang

AI总结:

针对相关聚类问题,提出高效组合算法,在亚线性时间/空间或MPC常数轮内实现优于1.847/1.876的近似,显著改进现有结果。

摘要:

相关聚类是一种经典的聚类目标,出现在众多机器学习和数据挖掘应用中。给定一个图$G=(V,E)$,目标是将顶点集划分为若干簇,以最小化簇间边的数量加上簇内缺失边的数量。该问题是APX难的,目前已知的最佳多项式时间近似因子为1.73,由Cohen-Addad、Lee、Li和Newman在[FOCS'23]中提出。他们使用了具有$|V|^{1/ε^{Θ(1)}}$个变量的线性规划,其中$ε$为某个小常数。然而,由于相关聚类的实际相关性,人们也对获得更高效的顺序和并行算法产生了浓厚兴趣。Ailon、Charikar和Newman在[JACM'08]中提出的经典组合式“枢轴”算法在线性时间内提供了3近似。与本文讨论的大多数其他算法一样,该算法使用了随机化。最近,Behnezhad、Charikar、Ma和Tan在[FOCS'22]中提出了在Massively Parallel Computation(MPC)设置下以常数轮数解决问题的$3+ε$近似解。非常近期,Cao、Huang和Su在[SODA'24]中提供了在MPC模型中多项式对数轮数内的2.4近似,以及在经典顺序设置中$\tilde{O}(|E|^{1.5})$时间内的2.4近似。他们询问是否有可能在近线性时间内获得优于3的近似?我们用一种高效的组合算法解决了这个问题,该算法提供了大幅改进的近似因子。它在亚线性($\tilde O(|V|)$)顺序时间或流式设置中的亚线性($\tilde O(|V|)$)空间内实现了$\thicksim 2-2/13 < 1.847$近似。在MPC模型中,我们给出了一种仅使用常数轮数的算法,实现了$\thicksim 2-1/8 < 1.876$近似。

英文摘要:

Correlation Clustering is a classic clustering objective arising in numerous machine learning and data mining applications. Given a graph $G=(V,E)$, the goal is to partition the vertex set into clusters so as to minimize the number of edges between clusters plus the number of edges missing within clusters. The problem is APX-hard and the best known polynomial time approximation factor is 1.73 by Cohen-Addad, Lee, Li, and Newman [FOCS'23]. They use an LP with $|V|^{1/ε^{Θ(1)}}$ variables for some small $ε$. However, due to the practical relevance of correlation clustering, there has also been great interest in getting more efficient sequential and parallel algorithms. The classic combinatorial \emph{pivot} algorithm of Ailon, Charikar and Newman [JACM'08] provides a 3-approximation in linear time. Like most other algorithms discussed here, this uses randomization. Recently, Behnezhad, Charikar, Ma and Tan [FOCS'22] presented a $3+ε$-approximate solution for solving problem in a constant number of rounds in the Massively Parallel Computation (MPC) setting. Very recently, Cao, Huang, Su [SODA'24] provided a 2.4-approximation in a polylogarithmic number of rounds in the MPC model and in $\tilde{O} (|E|^{1.5})$ time in the classic sequential setting. They asked whether it is possible to get a better than 3-approximation in near-linear time? We resolve this problem with an efficient combinatorial algorithm providing a drastically better approximation factor. It achieves a $\sim 2-2/13 < 1.847$-approximation in sub-linear ($\tilde O(|V|)$) sequential time or in sub-linear ($\tilde O(|V|)$) space in the streaming setting. In the MPC model, we give an algorithm using only a constant number of rounds that achieves a $\sim 2-1/8 < 1.876$-approximation.

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

↑