arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2205.07593cs.DScs.DC
收藏

动态流中的 $(3+\varepsilon)$-近似相关聚类算法

A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams

Mélanie Cambus, Fabian Kuhn, Etna Lindy, Shreyas Pai, Jara Uitto

AI总结:

本文提出了一种适用于动态流的单次遍历半流式相关聚类算法,通过稀疏化输入图实现了 $(3+\varepsilon)$-近似比,改进了现有算法的近似比和遍历次数,且是首个使用多项式后处理时间的单次遍历算法。

摘要:

在数据挖掘和机器学习中,将相似的元素分组是一项常见任务。本文研究了相关聚类的流式算法,其中每对元素被标记为相似或不相似。任务是对元素进行划分,目标是最小化分歧,即被分在同一组的不相似元素的数量以及被分在不同组的相似元素的数量。我们的主要贡献是一种半流式算法,该算法在流上进行单次遍历时,能实现对最小分歧数的 $(3 + \varepsilon)$-近似。此外,该算法也适用于动态流。我们的方法建立在 Ailon、Charikar 和 Newman [JACM'08] 对 PIVOT 算法的分析基础之上,该算法在集中式设置中获得了 $3$-近似。我们的设计允许我们通过忽略大部分节点和边来稀疏化输入图,且与 PIVOT 的分析相比,不会产生大量的额外成本。这种稀疏化使得我们的技术能够应用于半流式等模型中,在这些模型中,稀疏图通常可以被更高效地处理。我们的工作改进了近期单次遍历 $5$-近似算法的近似比,并减少了近期 $O(1/\varepsilon)$-遍历 $(3 + \varepsilon)$-近似算法 [Behnezhad, Charikar, Ma, Tan FOCS'22, SODA'23] 的遍历次数。我们的算法也更鲁棒,可应用于动态流。此外,这是首个使用多项式后处理时间的单次遍历 $(3 + \varepsilon)$-近似算法。

英文摘要:

Grouping together similar elements in datasets is a common task in data mining and machine learning. In this paper, we study streaming algorithms for correlation clustering, where each pair of elements is labeled either similar or dissimilar. The task is to partition the elements and the objective is to minimize disagreements, that is, the number of dissimilar elements grouped together and similar elements that get separated. Our main contribution is a semi-streaming algorithm that achieves a $(3 + \varepsilon)$-approximation to the minimum number of disagreements using a single pass over the stream. In addition, the algorithm also works for dynamic streams. Our approach builds on the analysis of the PIVOT algorithm by Ailon, Charikar, and Newman [JACM'08] that obtains a $3$-approximation in the centralized setting. Our design allows us to sparsify the input graph by ignoring a large portion of the nodes and edges without a large extra cost as compared to the analysis of PIVOT. This sparsification makes our technique applicable in models such as semi-streaming, where sparse graphs can typically be handled much more efficiently. Our work improves on the approximation ratio of the recent single-pass $5$-approximation algorithm and on the number of passes of the recent $O(1/\varepsilon)$-pass $(3 + \varepsilon)$-approximation algorithm [Behnezhad, Charikar, Ma, Tan FOCS'22, SODA'23]. Our algorithm is also more robust and can be applied in dynamic streams. Furthermore, it is the first single pass $(3 + \varepsilon)$-approximation algorithm that uses polynomial post-processing time.

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

↑