arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2510.11547cs.DS
收藏

估计单链接聚类成本的次线性算法

Sublinear Algorithms for Estimating Single-Linkage Clustering Costs

University of Science and Technology of China(中国科学技术大学);University of Cologne(科隆大学)

Pan Peng, Christian Sohler, Yi Xu

AI总结:

针对单链接聚类成本轮廓,提出基于采样的次线性算法,以O~(d√W/ε^3)时间输出草图,实现ℓ1误差ε·cost(G)的近似,并证明近乎匹配的查询下界。

摘要:

单链接聚类(SLC)是层次数据分析的一种基本方法。在距离设定下,通过计算最小生成树(MST)并删除其最重的k-1条边,可以得到SLC产生的k聚类。这自然引出了SLC层次结构的成本轮廓:对于每个k∈[n],我们定义cost_k为所得k分量生成森林的权重,等价地,为恰好具有k个连通分量的任何生成森林的最小总权重。相应的SLC成本轮廓为(cost_1,…,cost_n),标量量cost(G)=∑_{k=1}^{n}cost_k是该轮廓下的面积。我们研究在次线性时间内近似这些量的问题。我们假设输入是一个平均度为d、边权在{1,…,W}中的加权图G,通过邻接表查询访问;缺失边被视为具有无限距离。我们的主要结果是一种基于采样的算法,在距离设定下输出整个SLC成本轮廓的简洁草图。该算法运行时间为O~(d√W/ε^3),并返回一个草图,从中可以推导出估计值(ĉost_1,…,ĉost_n),满足∑_{k=1}^{n}|ĉost_k-cost_k|≤ε·cost(G)。因此,我们获得了整个轮廓的ℓ1近似,其误差至多为真实轮廓下面积的ε比例。特别地,这在同一运行时间内产生了cost(G)的(1±ε)近似。我们还证明了估计cost(G)的近乎匹配的下界Ω(d√W/ε^2)次查询。

英文摘要:

Single-linkage clustering (SLC) is a fundamental method for hierarchical data analysis. In the distance setting, a $k$-clustering produced by SLC can be obtained by computing a minimum spanning tree (MST) and deleting its $k-1$ heaviest edges. This naturally induces a cost profile for the SLC hierarchy: for each $k\in[n]$, we define $\mathrm{cost}_k$ to be the weight of the resulting $k$-component spanning forest, equivalently, the minimum total weight of any spanning forest with exactly $k$ connected components. The corresponding \emph{SLC cost profile} is $(\mathrm{cost}_1,\ldots,\mathrm{cost}_n)$, and the scalar quantity $\mathrm{cost}(G)=\sum_{k=1}^{n}\mathrm{cost}_k$ is the area under this profile. We study the problem of approximating these quantities in sublinear time. We assume that the input is a weighted graph $G$ of average degree $d$ with edge weights in $\{1,\dots,W\}$, accessed through adjacency-list queries; missing edges are treated as having infinite distance. Our main result is a sampling-based algorithm that outputs a succinct sketch of the entire SLC cost profile in the distance setting. The algorithm runs in $\widetilde{O}(d\sqrt{W}/\varepsilon^3)$ time and returns a sketch from which one can derive estimates $(\widehat{\mathrm{cost}}_1,\ldots,\widehat{\mathrm{cost}}_n)$ satisfying $\sum_{k=1}^{n}\bigl|\widehat{\mathrm{cost}}_k-\mathrm{cost}_k\bigr| \le \varepsilon\,\mathrm{cost}(G)$. Thus, we obtain an $\ell_1$ approximation to the full profile whose error is at most an $\varepsilon$-fraction of the area under the true profile. In particular, this yields a $(1\pm\varepsilon)$-approximation to $\mathrm{cost}(G)$ within the same running time. We also prove a nearly matching lower bound of $Ω(d\sqrt{W}/\varepsilon^2)$ queries for estimating $\mathrm{cost}(G)$.

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

↑