Discrimination aware decision tree learning

F. Kamiran, T.G.K. Calders, M. Pechenizkiy

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

112 Citations (Scopus)

Abstract

Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute B, find a classifier with high predictive accuracy that at the same time does not discriminate on the basis of the given attribute B. This problem is motivated by the fact that often available historic data is biased due to discrimination, e.g., when B denotes ethnicity. Using the standard learners on this data may lead to wrongfully biased classifiers, even if the attribute B is removed from training data. Existing solutions for this problem consist in "cleaning away" the discrimination from the dataset before a classifier is learned. In this paper we study an alternative approach in which the non-discrimination constraint is pushed deeply into a decision tree learner by changing its splitting criterion and pruning strategy. Experimental evaluation shows that the proposed approach advances the state-of-the-art in the sense that the learned decision trees have a lower discrimination than models provided by previous methods, with little loss in accuracy.
Original languageEnglish
Title of host publicationProceedings of the 10th IEEE International Conference on Data Mining (ICDM, Sydney, Australia, December 14-17, 2010)
PublisherInstitute of Electrical and Electronics Engineers
Pages869-874
ISBN (Print)978-0-7695-4256-0
DOIs
Publication statusPublished - 2010

Fingerprint Dive into the research topics of 'Discrimination aware decision tree learning'. Together they form a unique fingerprint.

Cite this