Papers › Improved Approximation for Fair Correlation Clustering

Improved Approximation for Fair Correlation Clustering

9 Jun 2022arXiv:2206.05050archive 2025-07-28

Sara Ahmadian, Maryam Negahbani

Correlation clustering is a ubiquitous paradigm in unsupervised machine learning where addressing unfairness is a major challenge. Motivated by this, we study Fair Correlation Clustering where the data points may belong to different protected groups and the goal is to ensure fair representation of all groups across clusters. Our paper significantly generalizes and improves on the quality guarantees of previous work of Ahmadi et al. and Ahmadian et al. as follows. - We allow the user to specify an arbitrary upper bound on the representation of each group in a cluster. - Our algorithm allows individuals to have multiple protected features and ensure fairness simultaneously across them all. - We prove guarantees for clustering quality and fairness in this general setting. Furthermore, this improves on the results for the special cases studied in previous work. Our experiments on real-world data demonstrate that our clustering quality compared to the optimal solution is much better than what our theoretical result suggests.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 11 code samples harvested from 1 repository linked to this paper: 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 11 samples from 1 repository, 11 ran (11 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-25 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

moonin12/improved_fair_correlation_clustering officialmentioned in paperMITSyntology: 11 samples, 11 ran (0 instrument-failed) · 0 unverified report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

11 samples harvested: 11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

11ran

Licence: 0 of the 11 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from moonin12/improved_fair_correlation_clustering. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

moonin12/improved_fair_correlation_clustering official repository 11 samples, 11 ran (0 instrument-failed) · 0 unverified
clean_data in 13 papers utils/old_read_write_utils.py ran MIT (permissive) · 37e838e6c3aa3fed · report fixture: signature df:DataFrame/0/?, numeric_features:list/1/str, text_features:list/1/str · returned DataFrame · level recorded 2026-09-25
create_graph_form_vectors utils/read_write_utils.py ran MIT (permissive) · 992b382711ab07fd · report fixture: signature df:DataFrame/0/?, theta:float/0/float, max_nr_color:int/0/int, min_nr_color:int/0/int, color_columns:list/1/str, vector_columns:list/1/str, sample_per_color:NoneType/0/? · returned dict · level recorded 2026-09-25
get_cluster_inds_from_clusters utils/clustering_utils.py ran MIT (permissive) · 19c529a03d910b6b · report fixture: signature clusters:list/1/list, nr_nodes:int/0/int · returned list · level recorded 2026-09-25
get_constraints fair_corr_lp_solver.py ran MIT (permissive) · d6c772a336f6d06a · report fixture: signature graph:dict/0/?, alphas:dict/0/? · returned dict · level recorded 2026-09-25
get_corr_clustering_error utils/clustering_utils.py ran MIT (permissive) · eba6dc095e1032ab · report fixture: signature clusters:list/1/list, graph:dict/0/? · returned float · level recorded 2026-09-25
get_corr_clustering_fairness_viol utils/clustering_utils.py ran MIT (permissive) · d86464f4962ad6f5 · report fixture: signature nr_nodes:int/0/int, nondegen_clusters:list/1/list, nondegen_color_dists:list/1/dict, alphas:dict/0/? · returned float · level recorded 2026-09-25
get_edge_name fair_corr_lp_solver.py ran MIT (permissive) · 233410e319cfffd4 · report fixture: signature u:int/0/int, v:int/0/int · returned str · level recorded 2026-09-25
get_variables in 6 papers fair_corr_lp_solver.py ran MIT (permissive) · c92255ff35176f3a · report fixture: signature graph:dict/0/? · returned dict · level recorded 2026-09-25
int_list_to_str utils/read_write_utils.py ran fingerprinted MIT (permissive) · 5ca43db53fdaf602 · report fixture: signature list:list/1/int · returned str · level recorded 2026-09-25
read_csv_data in 6 papers utils/read_write_utils.py ran MIT (permissive) · ec0f235a9e16f087 · report fixture: signature dataset_name:str/0/str, input_dir:str/0/str, has_index:bool/0/bool, has_header:bool/0/bool, separator:str/0/str · returned DataFrame · level recorded 2026-09-25
read_list in 14 papers utils/configutil.py ran fingerprinted MIT (permissive) · 838cefd5b43af5fa · report fixture: signature config_string:str/0/str, delimiter:str/0/str · returned list · level recorded 2026-09-25

Tasks

ClusteringFairness

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections