Fair $k$ -Center:低维Coreset方法
Fair $k$-Center: a Coreset Approach in Low Dimensions
摘要:
基于中心的聚类技术在机器学习的某些领域(如数据汇总)中是基础的。通用的$k$ -中心算法可以产生有偏见的集群代表,所以最近一直有兴趣在公平的$k$ -中心聚类。我们的主要理论贡献是两个新的$(3+ε)$ -近似算法,用于解决公平$k$ -中心问题:(1)动态增量,即,one-pass streaming模型和(2)MapReduce模型。我们的动态增量算法是这个问题的第一个这样的算法(以前的流算法需要两个通道)和我们的MapReduce一个改进后,以前的近似因子的$(17+ε).$这两种算法的工作原理是通过维护一个小的coreset来表示完整的点集和他们的分析要求,底层的度量有有限倍的维度。我们还提供了高维数据和实验结果,比较我们的算法的性能与现有的相关的算法。
英文摘要:
Center-based clustering techniques are fundamental in some areas of machine learning such as data summarization. Generic $k$-center algorithms can produce biased cluster representatives so there has been a recent interest in fair $k$-center clustering. Our main theoretical contributions are two new $(3+ε)$-approximation algorithms for solving the fair $k$-center problem in (1) the dynamic incremental, i.e., one-pass streaming, model and (2) the MapReduce model. Our dynamic incremental algorithm is the first such algorithm for this problem (previous streaming algorithms required two passes) and our MapReduce one improves upon the previous approximation factor of $(17+ε).$ Both algorithms work by maintaining a small coreset to represent the full point set and their analysis requires that the underlying metric has finite-doubling dimension. We also provide related heuristics for higher dimensional data and experimental results that compare the performance of our algorithms to existing ones.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。