Probabilistic Fair Clustering
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color (e.g., membership in a group), and the features of a valid clustering might also include the representation of colors in that clustering. Prior work in fair clustering assumes complete knowledge of group membership. In this paper, we generalize prior work by assuming imperfect knowledge of group membership through probabilistic assignments. We present clustering algorithms in this more general setting with approximation ratio guarantees. We also address the problem of "metric membership", where different groups have a notion of order and distance. Experiments are conducted using our proposed algorithms as well as baselines to validate our approach and also surface nuanced concerns when group membership is not known deterministically.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringvalidSimilar Papers 제목 키워드 기반
FACROC: a fairness measure for FAir Clustering through ROC curves
Fair clustering has attracted remarkable attention from the research community. Many fairness measures for clustering have been proposed; however, they do not take into account the clustering quality w.r.t. the values of…
AttributeClusteringFairnessRobust Fair Clustering: A Novel Fairness Attack and Defense Framework
Clustering algorithms are widely used in many societal resource allocation applications, such as loan approvals and candidate recruitment, among others, and hence, biased or unfair model outputs can adversely impact indi…
Adversarial AttackClusteringFairnessgraph partitioningFairness in Clustering with Multiple Sensitive Attributes
A clustering may be considered as fair on pre-specified sensitive attributes if the proportions of sensitive attribute groups in each cluster reflect that in the dataset. In this paper, we consider the task of fair clust…
AttributeClusteringFairnessFair Community Detection and Structure Learning in Heterogeneous Graphical Models
Inference of community structure in probabilistic graphical models may not be consistent with fairness constraints when nodes have demographic attributes. Certain demographics may be over-represented in some detected com…
Community DetectionFairnessModel SelectionFair Clustering via Alignment
Algorithmic fairness in clustering aims to balance the proportions of instances assigned to each cluster with respect to a given sensitive attribute. While recently developed fair clustering algorithms optimize clusterin…
AttributeClusteringFairness