Consistency of Constrained Spectral Clustering under Graph Induced Fair Planted PartitionsDownload PDF

Published: 31 Oct 2022, Last Modified: 02 Jan 2023NeurIPS 2022 AcceptReaders: Everyone
Keywords: Spectral clustering, fairness, constrained clustering, consistency
Abstract: Spectral clustering is popular among practitioners and theoreticians alike. While performance guarantees for spectral clustering are well understood, recent studies have focused on enforcing "fairness" in clusters, requiring them to be "balanced" with respect to a categorical sensitive node attribute (e.g. the race distribution in clusters must match the race distribution in the population). In this paper, we consider a setting where sensitive attributes indirectly manifest in an auxiliary representation graph rather than being directly observed. This graph specifies node pairs that can represent each other with respect to sensitive attributes and is observed in addition to the usual similarity graph. Our goal is to find clusters in the similarity graph while respecting a new individual-level fairness constraint encoded by the representation graph. We develop variants of unnormalized and normalized spectral clustering for this task and analyze their performance under a fair planted partition model induced by the representation graph. This model uses both the cluster membership of the nodes and the structure of the representation graph to generate random similarity graphs. To the best of our knowledge, these are the first consistency results for constrained spectral clustering under an individual-level fairness constraint. Numerical results corroborate our theoretical findings.
TL;DR: A new individual level fairness constraint for clustering and accompanying spectral algorithms with guarantees.
Supplementary Material: zip
17 Replies