- Rating
- 4
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
The authors present a clustering method called Fair K-means Consensus Clustering, a method that incorporates group fairness in ensemble clustering. Existing approaches involve fairness constraints or add a regularization, but this paper proposes a method that adds an allocation dependent weighing mechanism directly into the clustering objective. The authors do so by adjusting how much each group's clustering error contributes to the objective based on the proportion of that group assigned to each cluster. This encourages a more balanced distribution of protected groups across clusters while still considering how well the data points fit their assigned clusters.
The main contribution of the paper is the new allocation-dependent clustering objective that adds group fairness directly into the clustering process by adding a weightage term to the clustering error based on how protected groups are distributed across clusters. The second contribution is the theoretical analysis of this objective, examination of when it can increase or worsen fairness and under what conditions different groups can achieve similar distributions. Last, they derive an efficient optimization algorithm that iteratively improves cluster assignments and guarantees convergence to a local optimum.
For validation, the evaluate their approach on nine datasets of different sizes and domains, comparing it against several existing ensemble clustering and fair clustering methods. They evaluate both clustering quality, using metrics such as ACC, NMI, and ARI, and group fairness using representation-based metrics. The results show that the proposed method generally improves both clustering performance and group representation, particularly compared to standard K-means Consenus Clustering.
Critical strengths
(S1) The formulation of the clustering algorithm that directly incorporates the weighing of protected groups into the algorithm without leaning on additional regularisation terms is quite novel and promising work. This is an interesting methodological contribution, as it provides an alternative way to address fairness while maintaining clustering quality.
(S2) There is a strong theoretical analysis of the proposed objective, including the behaviour of group allocations, the justification of the quadratic weighing and the convergence property of the optimization algorithm.
(S3) The authors also acknowledge and theoretically demonstrate cases where their method may not improve fairness, rather than claiming that fairness is always guaranteed. This makes the theoretical contribution more convincing.
(S4) The authors evaluate the method on nine datasets of differing size and domains, and the method is compared against a large number of existing fair clustering and ensemble clustering methods. The experiments show improvements in both clustering quality and fairness, particularly in the matched comparison with standard KCC, which is the direct algorithm from which this is derived.
Critical weaknesses
(W1) One of the main concerns is that the uniform-convergence analysis the authors use assumes a fixed representation that is independent of the samples used for clustering. However, in the experiments, the ensemble representations are constructed using the same dataset on which clustering is performed. But the authors acknowledge this distinction, but it means that the statistical guarantees do not directly apply to their actual experimental pipeline. A theoretical extension covering the data-dependent ensemble construction, or additional experiments investigating generalization to unseen samples, would strengthen the paper.
Questions for authors
none
Fixed-representation assumption and independent-reference evaluation
We thank the reviewer for the comments and suggestions. The uniform-estimation result in Section 4.2 concerns the FKCC aggregation objective under a representation rule fixed independently of the aggregation sample. The manuscript distinguishes this sampling model from the same-sample construction used in the main experiments. Following your suggestion for additional experiments, we conducted an independent-reference experiment while retaining the original FKCC objective and solver.
For each dataset, we randomly divided objects within each protected group into approximately equal reference and aggregation sets. The reference set alone was used to estimate preprocessing statistics where needed, generate 20 base partitions with their corresponding cluster centers, and determine the ensemble-representation rule. The base-partition cluster counts were sampled from [k,⌈n⌉], with n the full dataset size and k the target consensus cluster count. The reference centers and representation rule were then fixed. Each aggregation object was assigned to the nearest cluster center for each reference partition, and its representation was constructed using the fixed rule. KCC and FKCC were optimized separately from identical initial assignments on the same aggregation representations. We evaluated their final partitions only on the aggregation objects, using ten random splits per dataset.
The table reports mean ± population standard deviation over the ten splits.
FKCC achieves higher mean ACC, ARI, MNCE, and Ffair on all nine datasets, and higher mean NMI on eight (the exception is HAR). Averaging the dataset-level means equally, the improvements over KCC are 0.0733 in ACC, 0.0520 in NMI, 0.0863 in ARI, 0.0328 in MNCE, and 0.0614 in Ffair.
Across the 90 paired runs, FKCC improves ACC in 72 runs (4 ties), and improves MNCE and Ffair in 83 runs each (2 ties each).
We also measured group-allocation profile discrepancy Δprof and average total variation (AvgTV), which compare each group's allocation distribution with the marginal cluster distribution. Both have lower dataset-level means on all nine datasets. Their equal-dataset averages decrease from 0.0148 to 0.0066 and from 0.0630 to 0.0409, respectively.
The new aggregation objects participate in consensus optimization but are excluded from constructing the reference partitions and fitting the representation rule. These results provide additional empirical evidence that FKCC's gains in clustering quality and group representation persist under this independent-reference protocol.