权重约束各向异性分配和聚类的核心集
Coresets for Weight-Constrained Anisotropic Assignment and Clustering
摘要:
本文构造了权约束各向异性分配和聚类的核心集。与研究得很好的无约束最小二乘聚类问题相比,在权重约束的各向异性情况下,近似聚类的质心不再足够,因为甚至涉及将点分配到最佳站点。这个分配步骤通常是材料科学中的限制因素,这是一个部分激励我们工作的问题。我们建立在Har-Peled和Kushal的一篇论文上,他们为无约束最小二乘聚类构建了大小为$\mathcal{O}\bigl(\frac{k^3}{ε^{d+1}}\bigr)$的核心集。我们推广和改进他们的结果在各种方式,导致更小的coresets的大小只有$\mathcal{O}\bigl(\frac{k^2}{ε^{d+1}}\bigr)$的权重约束的各向异性聚类。此外,我们回答了一个开放的问题coreset设计的负面影响,表明总的灵敏度可以成为大的基数的原始数据集在约束的情况下。因此,许多基于重要性采样的技术不适用于权重约束聚类。
英文摘要:
The present paper constructs coresets for weight-constrained anisotropic assignment and clustering. In contrast to the well-studied unconstrained least-squares clustering problem, approximating the centroids of the clusters no longer suffices in the weight-constrained anisotropic case, as even the assignment of the points to best sites is involved. This assignment step is often the limiting factor in materials science, a problem that partially motivates our work. We build on a paper by Har-Peled and Kushal, who constructed coresets of size $\mathcal{O}\bigl(\frac{k^3}{ε^{d+1}}\bigr)$ for unconstrained least-squares clustering. We generalize and improve on their results in various ways, leading to even smaller coresets with a size of only $\mathcal{O}\bigl(\frac{k^2}{ε^{d+1}}\bigr)$ for weight-constrained anisotropic clustering. Moreover, we answer an open question on coreset designs in the negative, by showing that the total sensitivity can become as large as the cardinality of the original data set in the constrained case. Consequently, many techniques based on importance sampling do not apply to weight-constrained clustering.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。