Fair Causal Feature Selection
Not on the map. Why?
Abstract (arXiv)
Fair feature selection for classification decision tasks has recently garnered significant attention from researchers. However, existing fair feature selection algorithms fall short of providing a full explanation of the causal relationship between features and sensitive attributes, potentially impacting the accuracy of fair feature identification. To address this issue, we propose a Fair Causal Feature Selection algorithm, called FairCFS. Specifically, FairCFS constructs a localized causal graph that identifies the Markov blankets of class and sensitive variables, to block the transmission of sensitive information for selecting fair causal features. Extensive experiments on seven public real-world datasets validate that FairCFS has comparable accuracy compared to eight state-of-the-art feature selection algorithms, while presenting more superior fairness.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 14 of its 74 references that are in the map. First posted on arXiv 17 Jun 2023.
Builds on
14 of 74 references.
References · 14
- 2016Equality of Opportunity in Supervised Learningcited by 2,007
- 2019A Survey on Bias and Fairness in Machine Learningcited by 1,917
- 2017Counterfactual Fairnesscited by 804
- 2017Algorithmic decision making and the cost of fairnesscited by 403
- 2016Fairness Beyond Disparate Treatment & Disparate Impact: Learning Classification without Disparate Mistreatmentcited by 369
- 2015The Variational Fair Autoencodercited by 223
- 2021A survey on datasets for fairness-aware machine learningcited by 157
- 2020Survey on Causal-based Machine Learning Fairness Notionscited by 54
- 2017Penalizing Unfairness in Binary Classificationcited by 25
- 2020Causal Feature Selection for Algorithmic Fairnesscited by 25
- 2018A Unified View of Causal and Non-causal Feature Selectioncited by 23
- 2017Forward-Backward Selection with Early Droppingcited by 18
2 more
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.