FAHT: An Adaptive Fairness-aware Decision Tree Classifier
원문 초록
Automated data-driven decision-making systems are ubiquitous across a wide spread of online as well as offline services. These systems, depend on sophisticated learning algorithms and available data, to optimize the service function for decision support assistance. However, there is a growing concern about the accountability and fairness of the employed models by the fact that often the available historic data is intrinsically discriminatory, i.e., the proportion of members sharing one or more sensitive attributes is higher than the proportion in the population as a whole when receiving positive classification, which leads to a lack of fairness in decision support system. A number of fairness-aware learning methods have been proposed to handle this concern. However, these methods tackle fairness as a static problem and do not take the evolution of the underlying stream population into consideration. In this paper, we introduce a learning mechanism to design a fair classifier for online stream based decision-making. Our learning model, FAHT (Fairness-Aware Hoeffding Tree), is an extension of the well-known Hoeffding Tree algorithm for decision tree induction over streams, that also accounts for fairness. Our experiments show that our algorithm is able to deal with discrimination in streaming environments, while maintaining a moderate predictive performance over the stream.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Guiding LLM Decision-Making with Fairness Reward Models
Improving Fairness of Large Language Models in Multi-document Summarization
Artificial Delegates Resolve Fairness Issues in Perpetual Voting with Partial Turnout
Fair for a few: Improving Fairness in Doubly Imbalanced Datasets
One Size Fits None: Rethinking Fairness in Medical AI
Towards Responsible AI: Advances in Safety, Fairness, and Accountability of Autonomous Systems
토론
이 논문과 연결된 포럼 글이 아직 없습니다.