Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp013t945t61z
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorSly, Allan-
dc.contributor.advisorBraverman, Mark-
dc.contributor.authorKim, DoWon-
dc.date.accessioned2019-07-25T18:52:14Z-
dc.date.available2019-07-25T18:52:14Z-
dc.date.created2019-05-06-
dc.date.issued2019-07-25-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp013t945t61z-
dc.description.abstractAs our society becomes increasingly automated, there is a social concern for algorithmic decision-making to be fair and objective. In this thesis, we initiate the study with an overview of several criteria for group fairness, their limitations and motivations, and the criterion of individual fairness. We start with the case of a single-classifier, and extend the fairness properties to systems using multiple classifiers in composition. We demonstrate how to construct such systems, and find that fairness in social situations varies greatly with context. We find that that classifiers that are fair-in-isolation may not necessary yield fair systems in naive composition, and fair systems can be constructed from individually unfair classifiers. Finally, we examine the behavior of group fairness criteria under systems of multiple classifiers.en_US
dc.format.mimetypeapplication/pdf-
dc.language.isoenen_US
dc.titleOn Fairness of Classification in Machine Learningen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2019en_US
pu.departmentMathematicsen_US
pu.pdf.coverpageSeniorThesisCoverPage-
pu.contributor.authorid960967827-
pu.certificateApplications of Computing Programen_US
Appears in Collections:Mathematics, 1934-2020

Files in This Item:
File Description SizeFormat 
KIM-DOWON-THESIS.pdf443.81 kBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.