A Methodology for Direct and Indirect Discrimination Prevention in Data Mining

Transcription

1 A Methodology for Direct and Indirect Discrimination Prevention in Data Mining Sara Hajian and Josep Domingo-Ferrer IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2013 Presented by Polina Rozenshtein

2 Outline Problem addressed Direct and indirect discrimination Background, definitions and measures Approach proposed Discrimination Measurement Data Transformation Algorithms and running time Experimental results

3 Problem Discrimination: direct or indirect. Direct discrimination: decisions are made based on sensitive attributes. Indirect discrimination (redlining): decisions are made based on nonsensitive attributes which are strongly correlated with biased sensitive ones. Decision rules

4 Definitions Dataset collection of records Item - attribute with its value, e.g., Race = black item set - collection of items X: {Foreign worker = Yes; City = NYC} classification rule - X C {yes/no} {Foreign worker = Yes; City = NYC} Hire = no

5 Definitions support, supp(x) - fraction of records that contain X confidence, conf X C - how often C appears in records that contain X conf X C = supp(x,c) supp(x) frequent classification rule: supp X, C > s conf X C > c negated item set: X = {Foreign worker = Yes} X = {Foreign worker = No}

6 Classification rules DI s - predetermined discriminatory items DI s = {Foreign worker = Yes; Race = Black} X C - potentially discriminatory (PD) X = A, B with A DI s, B DI s {Foreign worker = Yes; City = NYC} Hire = No X C - potentially nondiscriminatory (PND) X = D, B with D DI s, B DI s {Zip = 10451; City = NYC} Hire = No

7 Direct Discrimination Measure extended lift (elift): elift A, B C = conf(a,b C) conf(b C) A DI S A, B C is α-protective, if and elift A, B C < α A, B C is α-discriminatory, if elift A, B C α

8 Indirect Discrimination Measure Theorem: Let r: D, B C is PND; γ = conf(r: D, B C) and δ = conf B C > 0 A DI s, conf r b1 : A, B D β 1, conf r b2 : D, B A β 2 > 0 f x = β 1 β 2 β 2 + x 1 elb x, y = f(x) y, if f x > 0 0, otherwise Then if elb γ, δ α, then PD r : A, B C is α-discriminatory

9 Indirect Discrimination or not A PND rule r: D, B C is a redlining rule, if it could yield αdiscriminatory rule r 0 : A, B C available knowledge rules r b1 : A, B D and r b2 : D, B A With A DI s {Zip = 10451; City = NYC} Hire = No. A PND rule r: D, B C is a nonredlining rule, if it cannot yield α-discriminatory rule r 0 : A, B C available rules r b1 : A, B D and r b2 : D, B A and A DI s {Experience = Low; City = NYC} Hire = No.

10 The Approach Discrimination measurement: Find PD and PND Direct discrimination: In PD find α-discriminatory by elif() Indirect discrimination: In PND find redlining by elb() + background knowledge Data transformation: Alter dataset and remove discriminatory biases Minimum impact on data and legitimate rules

11 Direct rules protection A ID S, Wish elif r : A, B C > α conf(a,b C) conf(b C) < α Decrease conf A, B C = supp(a,b,c) supp(a,b) Decrease conf(a, B C) by increasing supp(a, B)! A, B C A, B C supp A, B, C remains the same

12 Direct rules protection 2 Wish elif r : A, B C > α conf(a,b C) conf(b C) < α Increase conf B C = supp(b,c) supp(b) Increase supp B, C! A, B C A, B C supp B remains the same

13 Direct rules generalization PD: {Foreign worker = Yes; City = NYC} Hire = No. PND: {Experience = Low; City = NYC} Hire = No. If conf r: D, B C conf r : A, B C, and conf A, B D = 1 then PD rule r : A, B C is an instance of a PND rule r: D, B C

14 Direct rules generalization PD: {Foreign worker = Yes; City = NYC} Hire = No. PND: {Experience = Low; City = NYC} Hire = No. 1) If conf r: D, B C p conf r : A, B C, 2) and conf A, B D p then PD rule r : A, B C is an p-instance of a PND rule r: D, B C Change α-discriminatory to be p-instance of some PND rule r: D, B C

15 Direct rules generalization Condition 2 is satisfied, but Condition 1 is not: Wish conf r: D, B C p conf r : A, B C Decrease conf r : A, B C, preserve conf A, B D A, B, D C A, B, D C Condition 1 is satisfied, but Condition 2 is not: Wish conf A, B D p Increase conf A, B D, preserve conf r: D, B C p conf r : A, B C Impossible

16 Direct rules generalization Use generalization when possible to increase number of PND Use generalization when at least Condition 2 is satisfied After generalization is done, use methods for direct protection Try to perform minimum transformation

17 Indirect Rule Protection The same strategy as for Directed Rule Protection: Wish elb conf r: D, B C, conf B C > α conf r b1 :A,B D conf r b2 :D,B A conf r b2:d,b A +conf r:d,b C 1 conf(b C) < α Method 1: Decrease conf A, B D A, B, D C A, B, D C Method 2: Increase conf B C A, B, D C A, B, D C

18 Simultaneous direct and indirect discrimination prevention Method 1 Method 2 Direct Rule Protection A, B C A, B C A, B C A, B C Indirect Rule Protection A, B, D C A, B, D C A, B, D C A, B, D C Lemma 1. Method 1 for DRP cannot be used for simultaneous DRP and IRP Method 1 for DRP might undo the protection provided by Method 1 for IRP

19 Simultaneous direct and indirect discrimination prevention Method 1 Method 2 Direct Rule Protection A, B C A, B C A, B C A, B C Indirect Rule Protection A, B, D C A, B, D C A, B, D C A, B, D C Lemma 2. Method 2 for IRP is beneficial for Method 2 for DRP. Method 2 for DRP is at worst neutral for Method 2 for IRP. Method 2 for DRP and Method 2 for IRP both increase conf(b C).

20 Simultaneous direct and indirect discrimination prevention Transform PD to PND when possible Run Method 2 for IRP for PND and Method 2 for DRP for the rest PD.

21 Algorithms DB database FR frequent rules MR direct discriminative rules DI s discriminative item set

22 Computational Cost m - the number of records in DB k - number of rules in FR h - number of records in subset DB c n - the number of discriminatory rules in MR O(m) to get DB c O(kh) to get impact(db c ) for all db c DB c O(h log h ) for sorting O(dm) for modification O(n (m + kh + h log h + dm))

23 Experiments German credit data set and adult data set. Direct discrimination prevention degree (DDPD): percentage of α-discriminatory rules that are no longer αdiscriminatory Direct discrimination protection preservation (DDPP): percentage of α-protective rules that remain α- protective IDPD and IDPP the same for redlining rules

24 German credit data set Min support 5%, min confidence 10% frequent classification rules background knowledge rules 37 redlining rules, 42 indirect and 991 direct discriminations

25 Information loss Misses cost (MC): percentage of lost rules Ghost cost (GC): percentage of introduced rules

26 Conclusions Considers frequent classification rule mining Defines direct and indirect discrimination Propose measures of discrimination Propose methods to modify dataset to avoid discrimination Meaningful qualitative results