Modification-Fair Cluster Editing

12/06/2021
by   Vincent Froese, et al.
0

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 vertex-colored graphs (the colors representing subgroups), standard algorithms for the NP-hard Cluster Editing problem may yield solutions that are biased towards subgroups of data (e.g., demographic groups), measured in the number of modifications incident to the members of the subgroups. We propose a modification fairness constraint which ensures that the number of edits incident to each subgroup is proportional to its size. To start with, we study Modification-Fair Cluster Editing for graphs with two vertex colors. We show that the problem is NP-hard even if one may only insert edges within a subgroup; note that in the classic "non-fair" setting, this case is trivially polynomial-time solvable. However, in the more general editing form, the modification-fair variant remains fixed-parameter tractable with respect to the number of edge edits. We complement these and further theoretical results with an empirical analysis of our model on real-world social networks where we find that the price of modification-fairness is surprisingly low, that is, the cost of optimal modification-fair differs from the cost of optimal "non-fair" solutions only by a small percentage.

READ FULL TEXT

page 15

page 16

research
10/18/2019

Cluster Editing parameterized above the size of a modification-disjoint P_3 packing is para-NP-hard

Given a graph G=(V,E) and an integer k, the Cluster Editing problem asks...
research
06/26/2020

On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering

Editing a graph into a disjoint union of clusters is a standard optimiza...
research
09/26/2017

A Parameterized View on Multi-Layer Cluster Editing

In classical Cluster Editing we seek to transform a given graph into a d...
research
01/01/2019

On the Parameterized Cluster Editing with Vertex Splitting Problem

In the Cluster Editing problem, a given graph is to be transformed into ...
research
10/14/2022

(1,1)-Cluster Editing is Polynomial-time Solvable

A graph H is a clique graph if H is a vertex-disjoin union of cliques. A...
research
07/20/2019

Complexity of Modification Problems for Reciprocal Best Match Graphs

Reciprocal best match graphs (RBMGs) are vertex colored graphs whose ver...
research
01/07/2021

Rankings for Bipartite Tournaments via Chain Editing

Ranking the participants of a tournament has applications in voting, pai...

Please sign up or login with your details

Forgot password? Click here to reset