Decorrelated Clustering with Data Selection Bias
Not on the map. Why?
Abstract (arXiv)
Most of existing clustering algorithms are proposed without considering the selection bias in data. In many real applications, however, one cannot guarantee the data is unbiased. Selection bias might bring the unexpected correlation between features and ignoring those unexpected correlations will hurt the performance of clustering algorithms. Therefore, how to remove those unexpected correlations induced by selection bias is extremely important yet largely unexplored for clustering. In this paper, we propose a novel Decorrelation regularized K-Means algorithm (DCKM) for clustering with data selection bias. Specifically, the decorrelation regularizer aims to learn the global sample weights which are capable of balancing the sample distribution, so as to remove unexpected correlations among features. Meanwhile, the learned weights are combined with k-means, which makes the reweighted k-means cluster on the inherent data distribution without unexpected correlation influence. Moreover, we derive the updating rules to effectively infer the parameters in DCKM. Extensive experiments results on real world datasets well demonstrate that our DCKM algorithm achieves significant performance gains, indicating the necessity of removing unexpected feature correlations induced by selection bias when clustering.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 29 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 0; 2024: 1.
6 papers.
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
- 2021Interventional Video Grounding with Dual Contrastive Learningcited by 94
- 2022Debiased Graph Neural Networks with Agnostic Label Selection Biascited by 25
- 2021Deep Attention-guided Graph Clustering with Dual Self-supervisioncited by 10
- 2024A Scalable Algorithm for Individually Fair K-means Clusteringcited by 8
- 2022EGRC-Net: Embedding-induced Graph Refinement Clustering Networkcited by 3
- 2024A Scalable Algorithm for Individually Fair K-means Clustering9 Feb 2024
- 2022EGRC-Net: Embedding-induced Graph Refinement Clustering Network19 Nov 2022
- 2022Debiased Graph Neural Networks with Agnostic Label Selection Bias19 Jan 2022
- 2021Deep Attention-guided Graph Clustering with Dual Self-supervision10 Nov 2021
- 2021Towards Out-Of-Distribution Generalization: A Survey31 Aug 2021
- 2021Interventional Video Grounding with Dual Contrastive Learning21 Jun 2021