FARF: A Fair and Adaptive Random Forests Classifier - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

FARF: A Fair and Adaptive Random Forests Classifier

Résumé

As Artificial Intelligence (AI) is used in more applications, the need to consider and mitigate biases from the learned models has followed. Most works in developing fair learning algorithms focus on the offline setting. However, in many real-world applications data comes in an online fashion and needs to be processed on the fly. Moreover, in practical application, there is a trade-off between accuracy and fairness that needs to be accounted for, but current methods often have multiple hyper-parameters with non-trivial interaction to achieve fairness. In this paper, we propose a flexible ensemble algorithm for fair decision-making in the more challenging context of evolving online settings. This algorithm, called FARF (Fair and Adaptive Random Forests), is based on using online component classifiers and updating them according to the current distribution, that also accounts for fairness and a single hyper-parameters that alters fairness-accuracy balance. Experiments on real-world discriminated data streams demonstrate the utility of FARF.

Dates et versions

hal-04468424 , version 1 (20-02-2024)

Identifiants

Citer

Wenbin Zhang, Albert Bifet, Xiangliang Zhang, Jeremy C. Weiss, Wolfgang Nejdl. FARF: A Fair and Adaptive Random Forests Classifier. Advances in Knowledge Discovery and Data Mining - 25th Pacific-Asia Conference, PAKDD 2021, Virtual Event, May 11-14, 2021, Proceedings, Part II, Apr 2021, Virtual, Singapore. pp.245--256, ⟨10.1007/978-3-030-75765-6_20⟩. ⟨hal-04468424⟩
2 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More