AI Paper Atlas

Research map / Learning theory and algorithms / Clustering

Generalized Reductions: Making any Hierarchical Clustering Fair and Balanced with Low Cost

Marina Knittel, Max Springer, John P Dickerson, MohammadTaghi Hajiaghayi

ICML 2023 · 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
Apply tree rebalance to the input hierarchyRebalanceTree · Theoretical relatively balanced hierarchical clusteringcost approximation factor: γ -> 3/2γHurt
Add subtree deletion and insertion after tree rebalancingRefineRebalanceTree · Theoretical ε-relatively balanced hierarchical clusteringcost approximation factor: 3/2γ -> 9γ/(2ε)Hurt
Increase fairness parameters c, δ, and kFairHC · Census and Bankcost ratioHurt
Apply FairHC to average-linkage hierarchiesCensus · Censuscluster color balanceImproved

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