The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Three naive Bayes approaches for discrimination-free classification.
Open accessAbstract
In this paper, we investigate how to modify the naive Bayes classifier in order to perform classification that is restricted to be independent with respect to a given sensitive attribute. Such independency restrictions occur naturally when the decision process leading to the labels in the data-set was biased; e.g., due to gender or racial discrimination. This setting is motivated by many cases in which there exist laws that disallow a decision that is partly based on discrimination. Naive application of machine learning techniques would result in huge fines for companies. We present three approaches for making the naive Bayes classifier discrimination-free: (i) modifying the probability of the decision being positive, (ii) training one model for every sensitive attribute value and balancing them, and (iii) adding a latent variable to the Bayesian model that represents the unbiased label and optimizing the model parameters for likelihood using expectation maximization. We present experiments for the three approaches on both artificial and real-life data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“When extending the classiier's (convex) loss function with fairness terms, researchers typically seek to balance fairness and accuracy (e.g.[5,26,36,52,57,98,119,141,153,168,208,314]).”
From Fairness in machine learning: A survey (2024) · cites this paper as [52]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Prior work on detecting discrimination has focused on measuring correlation or mutual information between inputs and outputs [79], discrepancies in the fractions of inputs that produce a given output [18, 19, 39-42, 87-89, 91], or discrepancies in output probability distributions [51].”
From Fairness testing: testing software for discrimination (2017) · cites this paper as [19]
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Much of the previous work has primarily focused on settings where the outcome or protected variable is binary.”
From An algorithm for removing sensitive information: Application to race-independent recidivism prediction (2019) · cites this paper as Calders and Verwer (2010)
Experimental — accuracy not yet measuredThe source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Methodology for achieving statistical parity has centered on removing information about the protected variables from the training data by transforming the training data.”
From An algorithm for removing sensitive information: Application to race-independent recidivism prediction (2019) · cites this paper as Calders and Verwer (2010)
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“In this case also, the methods are restricted to binary protected classes and binary outcome variables.”
From An algorithm for removing sensitive information: Application to race-independent recidivism prediction (2019) · cites this paper as Calders and Verwer (2010)
4 more claims about this paper
Create a free account to see every claim other papers make about this one.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The foundations of cost-sensitive learning
Elkan, C. (2001) · Cited by 1,945
Hand, D. J. (2007) · Drug Safety · doi:10.2165/00002018-200730070-00010 · Cited by 1,044
Discrimination-aware data mining
Pedreshi, D., Ruggieri, S., & Turini, F. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401959 · Cited by 676
Building Classifiers with Independency Constraints
Calders, T., Kamiran, F., & Pechenizkiy, M. (2009) · 2009 IEEE International Conference on Data Mining Workshops · doi:10.1109/icdmw.2009.83 · Cited by 468 · cited 1×
“In a series of recent papers (Pedreschi et al. 2008, 2009; Kamiran and Calders 2009; Calders et al. 2009), the topic of discrimination in data mining received quite some attention.”
BackgroundSelf-citationChan, P. K., & Stolfo, S. J. (1998) · Cited by 452
Classifying without discriminating
Kamiran, F., & Calders, T. (2009) · 2009 2nd International Conference on Computer, Control and Communication · doi:10.1109/ic4.2009.4909197 · Cited by 409
Self-citationMeasuring Discrimination in Socially-Sensitive Decision Records
Pedreschi, D., Ruggieri, S., & Turini, F. (2009) · Proceedings of the 2009 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.50 · Cited by 174
Data mining for discrimination discovery
Ruggieri, S., Pedreschi, D., & Turini, F. (2010) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1754428.1754432 · Cited by 166
Nearest Neighbour Classification with Monotonicity Constraints
Duivesteijn, W., & Feelders, A. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87479-9_38 · Cited by 95
Mining optimal decision trees from itemset lattices
Nijssen, S., & Fromont, É. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281250 · Cited by 79
Research works printed but not linked: 1
- Kamiran F, Calders T (2010) Classification with no discrimination by preferential sampling. In: Proc. Benelearn
Cited by
A Survey on Bias and Fairness in Machine Learning
Mehrabi, N., Morstatter, F., Saxena, N., Lerman, K., & Galstyan, A. (2022) · ACM Computing Surveys · doi:10.1145/3457607 · Cited by 5,812
The ethics of algorithms: Mapping the debate
Mittelstadt, B. D., Allo, P., Taddeo, M., Wachter, S., & Floridi, L. (2016) · Big Data & Society · doi:10.1177/2053951716679679 · Cited by 4,567
Barocas, S., & Selbst, A. D. (2014) · doi:10.2139/ssrn.2477899 · Cited by 3,048
Explainable AI: a review of machine learning interpretability methods
Linardatos, P., Papastefanopoulos, V., & Kotsiantis, S. (2020) · Entropy · doi:10.3390/e23010018 · Cited by 2,922
Fair prediction with disparate impact: a study of bias in recidivism prediction instruments
Chouldechova, A. (2017) · Big Data · doi:10.1089/big.2016.0047 · Cited by 2,159
Metadata
- Authors
- Calders, T., & Verwer, S.
- Affiliations
- Eindhoven University of Technology (NL)
- Corresponding author
- Verwer, Sicco
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2010-07-27
- Volume
- 21
- Issue
- 2
- Pages
- 277-292
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2097246321
- Cited by
- 764
- References
- 12
- Citations by year
- 2026: 27 · 2025: 60 · 2024: 67 · 2023: 92 · 2022: 77 · 2021: 91 · 2020: 97 · 2019: 76 · 2018: 28 · 2017: 36 · 2016: 24 · 2015: 19 · 2014: 26 · 2013: 13 · 2012: 22
- FWCI
- 36.75
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by-nc
- Locations
- Data Mining and Knowledge Discovery (publishedVersion, cc-by-nc)
- TU/e Research Portal (publishedVersion)
- TU/e Research Portal (submittedVersion)
- Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) (submittedVersion)
- Funders
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Ethics and Social Impacts of AI
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Social Sciences › Law › Discrimination and Equality Law
- Keywords
- Naive Bayes classifier, sensitive attributes, algorithmic fairness, decision bias, label bias, latent variable models, expectation-maximization algorithm, gender discrimination, racial discrimination
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Three naive Bayes approaches for discrimination-free classification. https://app.cochat.ai/papers/10.1007/s10618-010-0190-x
- The paper
- Calders, T., & Verwer, S. (2010). Three naive Bayes approaches for discrimination-free classification. Data Mining and Knowledge Discovery. https://doi.org/10.1007/s10618-010-0190-x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.