AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Probabilistic Fair Clustering

Seyed Esmaeili, Brian Brubach, Leonidas Tsepenekas, John Dickerson

NeurIPS 2020 · Learning theory and algorithms › Clustering · approach: Fairness-constrained clustering · 2 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the proposed fair clustering algorithm instead of color-blind clusteringk-means style clustering · Bank (two colors)maximum additive violation: 25 -> 1Improved
Enforce fairness via the proposed algorithmclustering · Bank (two colors)POF: POF <= 1.02Hurt
Enforce fairness via the proposed algorithm on Adult vs CreditCardmetric membership · Adult, CreditCardPOF: 5% vs 25%Mixed
Increase the number of clustersmetric membership fair clustering · Adult, CreditCardPOFHurt
Use the proposed algorithm instead of color-blind clusteringmetric membership · Adult, CreditCardnormalized max additive violation: 250 -> 1Improved
Increase the cluster size lower boundlarge cluster independent sampling algorithm · Census1990, k=5normalized violation: below 20%Improved
Use the large cluster algorithm with probabilistic multi-color assignmentsCensus1990 · Census1990, k=5POF: less than 50%Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy