atlas

Research map / Learning theory and algorithms / Clustering

Fair Clustering Through Fairlets

NeurIPS 2017 · Learning theory and algorithms › Clustering · approach: Fair clustering approximation · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (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 fairlet decomposition before clusteringFair k-center and k-median · (1, k)-fair centerapproximation ratio: 3Helped
Use flow-based fairlet decomposition before clusteringFair k-center · (1/t', k)-fair centerapproximation ratio: 4Helped
Use perfectly balanced fairlets before k-medianFair k-median · (1, k)-fair medianapproximation ratio: 2+\sqrt{3}+\epsilonHelped
Use flow-based fairlet decomposition before k-medianFair k-median · (1/t', k)-fair medianapproximation ratio: t'+1+\sqrt{3}+\epsilonHelped
Enforce minimum cluster balance using fair clustering rather than classical clusteringClustering algorithms · Diabetes, Bank, and CensusbalanceHelped
Enforce minimum cluster balance using fair clustering rather than classical clusteringClustering algorithms · Diabetes, Bank, and Censusclustering costHurt
Increase the number of clusters without enforcing fairnessClassical k-center and k-median · Diabetes, Bank, and CensusbalanceHurt

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