mlsanityData to 14 Oct 2026

Multi-View Fair Clustering Guided by Cross-View Sensitive Information Discrepancy

arXiv 2609.25811 ↗First posted 22 Sep 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Multi-view clustering (MVC) aims to uncover latent cluster structures by exploiting complementary information from multiple views. Despite substantial progress in clustering performance, fairness remains an important concern when MVC is applied to socially sensitive scenarios. Recent fair multi-view clustering methods have introduced fairness constraints into representation learning or clustering assignments. However, these methods generally treat different views under a largely uniform fairness mechanism, without explicitly distinguishing their varying levels of sensitive dependence during cross-view learning. In practice, different views may encode substantially different levels of sensitive information. Ignoring such cross-view discrepancy can allow highly sensitive-dependent views to influence less sensitive-dependent ones during cross-view learning, potentially degrading both clustering performance and fairness. To address this issue, we propose a novel multi-view fair clustering framework guided by cross-view sensitive information discrepancy. Specifically, we estimate the sensitive dependence of each view and develop a bias-ranked asymmetric alignment mechanism that encourages views with higher sensitive dependence to learn from those with lower sensitive dependence, while cross-view discrepancies are further exploited to adaptively regulate the alignment process. Moreover, fairness regularization is imposed on the consensus soft assignments to further promote group fairness. Extensive experiments on benchmark datasets demonstrate that the proposed method achieves a favorable balance between clustering quality and group fairness.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 35 references that are in the map. First posted on arXiv 22 Sep 2026.

Builds on

11 of 35 references.

References · 11

  1. 2018Fair Clustering Through Fairletscited by 176
  2. 2019Guarantees for Spectral Clustering with Fairness Constraintscited by 72
  3. 2020Individual Fairness for k-Clusteringcited by 56
  4. 2019Coresets for Clustering with Fairness Constraintscited by 51
  5. 2021Improved Approximation Algorithms for Individually Fair Clusteringcited by 33
  6. 2020Fair Hierarchical Clusteringcited by 25
  7. 2017Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorizationcited by 24
  8. 2021Diversity-aware k-median : Clustering with fair center representationcited by 16
  9. 2021Deep Fair Discriminative Clusteringcited by 10
  10. 2024A Scalable Algorithm for Individually Fair K-means Clusteringcited by 8
  11. 2025Adversarial Fair Multi-View Clusteringcited by 1

Built on by

Not cited yet.