BriefGPT.xyz
Dec, 2021
修改公平集群编辑
Modification-Fair Cluster Editing
HTML
PDF
Vincent Froese, Leon Kellerhals, Rolf Niedermeier
TL;DR
对于给定的图形应用NP-hard Cluster Editing问题的标准算法可能会产生偏向于数据子组(例如人口群体)的解决方案,我们提出了一种修改公平性约束条件,以确保每个子组的修改次数与其大小成比例,模型在现实社交网络上的经验分析表明,修改公平性的代价惊人地低。
Abstract
The classic
cluster editing
problem (also known as
correlation clustering
) asks to transform a given graph into a disjoint union of cliques (clusters) by a small number of edge modifications. When applied to
→