mlsanityData to 7 Oct 2026

Fair Feature Subset Selection using Multiobjective Genetic Algorithm

arXiv 2205.01512 ↗First posted 30 Apr 2022cs.NE cs.CY cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

The feature subset selection problem aims at selecting the relevant subset of features to improve the performance of a Machine Learning (ML) algorithm on training data. Some features in data can be inherently noisy, costly to compute, improperly scaled, or correlated to other features, and they can adversely affect the accuracy, cost, and complexity of the induced algorithm. The goal of traditional feature selection approaches has been to remove such irrelevant features. In recent years ML is making a noticeable impact on the decision-making processes of our everyday lives. We want to ensure that these decisions do not reflect biased behavior towards certain groups or individuals based on protected attributes such as age, sex, or race. In this paper, we present a feature subset selection approach that improves both fairness and accuracy objectives and computes Pareto-optimal solutions using the NSGA-II algorithm. We use statistical disparity as a fairness metric and F1-Score as a metric for model performance. Our experiments on the most commonly used fairness benchmark datasets with three different machine learning algorithms show that using the evolutionary algorithm we can effectively explore the trade-off between fairness and accuracy.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 6 of its 17 references that are in the map. First posted on arXiv 30 Apr 2022.

Builds on

6 of 17 references.

References · 6

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2019A Survey on Bias and Fairness in Machine Learningcited by 1,911
  3. 2018A Reductions Approach to Fair Classificationcited by 585
  4. 2018AI Fairness 360: An Extensible Toolkit for Detecting, Understanding, and Mitigating Unwanted Algorithmic Biascited by 319
  5. 2018Aequitas: A Bias and Fairness Audit Toolkitcited by 145
  6. 2018NEU: A Meta-Algorithm for Universal UAP-Invariant Feature Representationcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.

4 papers.