Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Fair Clustering via Hierarchical Fair-Dirichlet Process (2305.17557v1)

Published 27 May 2023 in stat.ML, cs.CY, and cs.LG

Abstract: The advent of ML-driven decision-making and policy formation has led to an increasing focus on algorithmic fairness. As clustering is one of the most commonly used unsupervised machine learning approaches, there has naturally been a proliferation of literature on {\em fair clustering}. A popular notion of fairness in clustering mandates the clusters to be {\em balanced}, i.e., each level of a protected attribute must be approximately equally represented in each cluster. Building upon the original framework, this literature has rapidly expanded in various aspects. In this article, we offer a novel model-based formulation of fair clustering, complementing the existing literature which is almost exclusively based on optimizing appropriate objective functions.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Abhisek Chakraborty (9 papers)
  2. Anirban Bhattacharya (65 papers)
  3. Debdeep Pati (62 papers)
Citations (3)

Summary

We haven't generated a summary for this paper yet.