欧几里得 k-中心公平聚类
Euclidean k-center Fair Clusterings
AI总结:
本文定义了一种带颜色上下界约束的欧几里得 k-中心公平聚类问题,并设计了多项式时间算法来求解最优公平聚类。
摘要:
许多用于寻找公平聚类的近似算法和启发式算法已经出现。在本文中,我们定义了公平聚类问题的一个新的自然变体,并设计了一个多项式时间算法来计算最优公平聚类。设 P 为平面上的 n 个点组成的集合,每个点具有 C 中的一种颜色,对应一个群体。对于 C 中的每种颜色 q,给定下界 l(q) 和上界 u(q)。然后我们如下定义公平聚类问题。公平 k-聚类问题是寻找将 P 划分为 k 个簇且成本最小的划分,使得每个簇中颜色为 q 的 P 中点至少包含 l(q) 个、至多包含 u(q) 个。通过 l(q) 和 u(q),每个簇不能包含过少或过多的具有特定颜色的点。如果我们将一种颜色视为一种性别或一个少数族裔群体,则该聚类对应于一种公平聚类。
英文摘要:
Many approximation algorithms and heuristic algorithms to find a fair clustering have emerged. In this paper we define a new and natural variant of fair clustering problem and design a polynomial time algorithm to compute an optimal fair clustering. Let P be a set of n points on a plane, and each point has a color in C, corresponding to a group. For each color q in C, a lower bound l(q) and an upper bound u(q) are given. Then we define the fair clustering problem as follows. The fair k-clustering problem is to find a partition of P into a set of k clusters with a minimum cost such that each cluster contains at least l(q) and at most u(q) points in P with color q. By l(q) and u(q) each cluster cannot contain too few or too many points with a specific color. If we regard a color to a gender or a minority ethnic group, the clustering corresponds to a fair clustering.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。