-
Notifications
You must be signed in to change notification settings - Fork 1
/
fairconstraints.py
471 lines (377 loc) · 18 KB
/
fairconstraints.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
import numpy as np
import pandas as pd
import itertools
from statistics import mean
def setDMC(X, y, classLabel, group_pair):
'''
Creates two vectors, one for group1 and one for group2, that has element = 1 if the sample has label==classLabel AND belongs to the group
'''
n = len(y)
temp = np.zeros(n)
# Change all entries with the occuring classlabel to 1 to count in the summation
for idx in range(0,n):
if y[idx] == classLabel:
temp[idx] = 1
dfX = pd.DataFrame(X)
sensitive_attribute = dfX[0] # sensitive attribute should be first column of data set, create vector indicating grouplabel of each sample
group1 = temp.copy()
group2 = temp.copy()
# Given a grouppair, change all entries with the occuring group to 1 for Pk,1 and the complement for Pk,0
for idx in range(0,n):
if temp[idx] == 1:
if sensitive_attribute[idx] == group_pair[0]: # does not work for continuous values
group2[idx] = 0
else:
group1[idx] = 0
return group1, group2
def setODM(X, y, group_pair):
'''
Creates vector for group1 and group2 with element=1 if the sample belongs to the corresponding group (1 or 2)
'''
n = len(y)
setI = np.ones(len(y))
dfX = pd.DataFrame(X)
sensitive_attribute = dfX[0]
group1 = setI.copy()
group2 = setI.copy()
for idx in range(0,n):
if sensitive_attribute[idx] == group_pair[0]:
group2[idx] = 0
else:
group1[idx] = 0
return group1, group2
def create_setsPI(X,y, groups, metric):
'''
Create sets I for each class k and pair of groups.
'''
pairs = list(itertools.combinations(groups,2))
setP_pairs = [] #this is for DMC, so based on class k and grouppair (g,g')
setI_pairs = [] #this is for ODM, so only based on grouppair (g,g')
setI = [] # this won't be used as fairnes constraints won't be added
classes = pd.unique(y)
classes.sort()
if len(classes) > 2:
for idx in range(0, len(classes)):
classLabel = classes[idx]
for pair in pairs:
if metric == None:
group1 = np.zeros(len(y))
group2 = np.zeros(len(y))
setI.append([group1, group2])
constraintSet = setI
if metric == "dmc":
group1, group2 = setDMC(X, y, classLabel, pair)
setP_pairs.append([group1,group2])
constraintSet = setP_pairs
if metric == "odm":
group1, group2 = setODM(X,y, pair)
setI_pairs.append([group1, group2])
constraintSet = setI_pairs
if len(classes) == 2:
if metric == "odm":
for pair in pairs:
group1, group2 = setODM(X,y, pair)
setI_pairs.append([group1, group2])
constraintSet = setI_pairs
if metric == "EqOpp":
classLabel = 1
for pair in pairs:
group1, group2 = setDMC(X, y, classLabel, pair)
setP_pairs.append([group1,group2])
constraintSet = setP_pairs
if metric == "dmc":
for idx in range(0, len(classes)):
for pair in pairs:
classLabel = classes[idx]
group1, group2 = setDMC(X, y, classLabel, pair)
setP_pairs.append([group1,group2])
constraintSet = setP_pairs
# for pair in pairs:
# if metric == None:
# group1 = np.zeros(len(y))
# group2 = np.zeros(len(y))
# setI.append([group1, group2])
# constraintSet = setI
# if metric == "odm":
# print('Binary-class, ODM')
# group1, group2 = setODM(X,y, pair)
# setI_pairs.append([group1, group2])
# constraintSet = setI_pairs
# if metric == "EqOpp":
# classLabel = 1 # We only create the set Ikg and Ikg' for k = 1 (the positive class)
# group1, group2 = setDMC(X, y, classLabel, pair)
# setP_pairs.append([group1,group2])
# constraintSet = setP_pairs
# if metric == "dmc":
# # We create the set Ikg and Ikg' for k = 0,1 (the positive class AND negative class). Note that this is the same as Equalized Odds
# print('Binary-class, DMC/Equalized Odds')
# classLabel = 0
# group1, group2 = setDMC(X, y, classLabel, pair)
# setP_pairs.append([group1,group2])
# classLabel = 1 #second class should be the advantageous one for calculating scores.
# group1, group2 = setDMC(X, y, classLabel, pair)
# setP_pairs.append([group1,group2])
# constraintSet = setP_pairs
return constraintSet, pairs
def fairnessEvaluation(y_actual, y_pred, setsP, classes, pairs): #Only for multi-class!
if len(classes)>2: # for Multi-Class
unfairness_mat = []
for pair in setsP:
set_group1 = pair[0]
set_group2 = pair[1]
setsize_group1 = int(sum(set_group1))
setsize_group2 = int(sum(set_group2))
if setsize_group1==0:
alpha=0
elif setsize_group2==0:
alpha=0
else:
u1 = np.zeros(len(y_actual))
u2 = np.zeros(len(y_actual))
# MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
for idx in range(0, len(set_group1)):
if set_group1[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u1[idx] = 1
# MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
for idx in range(0, len(set_group2)):
if set_group2[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u2[idx] = 1
# print("number of misclassifications in i in Pkg: ", sum(u1))
# print("number of misclassifications in i in Pkg': ", sum(u2))
# print("set size group1: ", setsize_group1)
# print("set size group2: ", setsize_group2)
alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
unfairness_mat.append(alpha)
unfairness = unfairnessLevel_multiclass(unfairness_mat, classes, pairs)
else: # For Binary Class
#pair = setsP[1] #setsP = [(I0,I1) (label=0), (I0,I1) (label=1)], so setsP[1] are the samples with postive label 1 belonging to group 0 and group 1
pair = setsP[0] #setsP = [ (I0, I1) ]. Label doesn't matter in ODM
set_group1 = pair[0]
set_group2 = pair[1]
setsize_group1 = int(sum(set_group1))
setsize_group2 = int(sum(set_group2))
# print(setsize_group1)
# print(setsize_group2)
if setsize_group1==0:
alpha=0
elif setsize_group2==0:
alpha=0
else:
u1 = np.zeros(len(y_actual))
u2 = np.zeros(len(y_actual))
# MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
for idx in range(0, len(set_group1)):
if set_group1[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u1[idx] = 1
# MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
for idx in range(0, len(set_group2)):
if set_group2[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u2[idx] = 1
alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
unfairness = alpha
return unfairness
if len(classes)==2: # For Binary Class
# Assume that the second class of binary class is the advantageous one, so 0 = negative, 1 = positive
pair = setsP[1]
set_group1 = pair[0]
set_group2 = pair[1]
setsize_group1 = int(sum(set_group1))
setsize_group2 = int(sum(set_group2))
# print(setsize_group1)
# print(setsize_group2)
if setsize_group1==0:
alpha=0
elif setsize_group2==0:
alpha=0
else:
u1 = np.zeros(len(y_actual)) #misclassification counting vectors for group 1 and 2 below.
u2 = np.zeros(len(y_actual))
# MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
for idx in range(0, len(set_group1)):
if set_group1[idx] == 1: #if in group 1
if y_actual[idx] != y_pred[idx]: #if misclassified
u1[idx] = 1 #set counting vector idx to 1
# MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
for idx in range(0, len(set_group2)):
if set_group2[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u2[idx] = 1
alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
unfairness = alpha
return unfairness
def binary_EqOdds(y_actual, y_pred, setsP, classes, pairs):
if len(classes)==2: # For Binary Class
# Assume that the second class of binary class is the advantageous one, so 0 = negative, 1 = positive
#GROUP 1 AND 2 WITH LABEL 0
pair_label0 = setsP[0]
label0_group0 = pair_label0[0]
label0_group1 = pair_label0[1]
label0_group0_size = int(sum(label0_group0)) #number of samples with label0 belonging to group 1
label0_group1_size = int(sum(label0_group1)) #number of samples with label0 belonging to group 2
#GROUP 1 AND 2 WITH LABEL 1
pair_label1 = setsP[1]
label1_group0 = pair_label1[0]
label1_group1 = pair_label1[1]
label1_group0_size = int(sum(label1_group0)) #number of samples with label0 belonging to group 1
label1_group1_size = int(sum(label1_group1)) #number of samples with label0 belonging to group 2
if label0_group0_size==0 or label0_group1_size==0 or label1_group0_size==0 or label1_group1_size==0:
alpha=0
else:
#CREATING TERM FOR GAP BETWEEN FALSE POSITIVES BETWEEN GROUPS
FP_u0 = np.zeros(len(y_actual)) #Vector with index 1 if group 0 with label 0 is falsely, positively classified as 1
FP_u1 = np.zeros(len(y_actual)) #Vector with index 1 if group 1 with label 0 is falsely, positively classified as 1
#MISCLASSIFICATION COUNTING VECTOR FOR LABEL=0, GROUP=0,1
for idx in range(0, len(label0_group0)):
if label0_group0[idx]==1: #if in group 0, with label 0
if y_actual[idx] != y_pred[idx]: #if misclassified
FP_u0[idx] = 1
for idx in range(0, len(label0_group1)):
if label0_group1[idx]==1: #if in group 1, with label 0
if y_actual[idx] != y_pred[idx]: #if misclassified
FP_u1[idx] = 1
FPR0 = (1/label0_group0_size)*sum(FP_u0)
FPR1 = (1/label0_group1_size)*sum(FP_u1)
FPR_gap = abs(FPR0-FPR1)
#CREATING TERM FOR GAP BETWEEN FALSE POSITIVES BETWEEN GROUPS
FN_u0 = np.zeros(len(y_actual)) #Vector with index 1 if group 0 with label 1 is falsely, negatively classified as 0
FN_u1 = np.zeros(len(y_actual)) #Vector with index 1 if group 1 with label 1 is falsely, negatively classified as 0
#MISCLASSIFICATION COUNTING VECTOR FOR LABEL=1, GROUP=0,1
for idx in range(0, len(label1_group0)):
if label1_group0[idx]==1: #if in group 0, with label 1
if y_actual[idx] != y_pred[idx]: #if misclassified
FN_u0[idx] = 1
for idx in range(0, len(label1_group1)):
if label1_group1[idx]==1: #if in group 1, with label 1
if y_actual[idx] != y_pred[idx]: #if misclassified
FN_u1[idx] = 1
FNR0 = (1/label1_group0_size)*sum(FN_u0)
FNR1 = (1/label1_group1_size)*sum(FN_u1)
FNR_gap = abs(FNR0-FNR1)
alpha = FPR_gap + FNR_gap
unfairness=alpha
# # MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
# for idx in range(0, len(set1_group1)):
# if set0_group1[idx]==1 or set1_group1[idx]==1: #if in group 1
# if y_actual[idx] != y_pred[idx]: #if misclassified
# u1[idx] = 1 #set counting vector idx to 1
# # MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
# for idx in range(0, len(set0_group2)):
# if set0_group2[idx] == 1 or set1_group2[idx]==1: #if in group 2
# if y_actual[idx] != y_pred[idx]:
# u2[idx] = 1
# alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
# alpha = abs((1/(setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2)))
# unfairness = alpha
return unfairness
def binary_EqOdds_original(y_actual, y_pred, setsP, classes, pairs):
if len(classes)==2: # For Binary Class
# Assume that the second class of binary class is the advantageous one, so 0 = negative, 1 = positive
pair = setsP[1]
set_group1 = pair[0]
set_group2 = pair[1]
setsize_group1 = int(sum(set_group1))
setsize_group2 = int(sum(set_group2))
# print(setsize_group1)
# print(setsize_group2)
if setsize_group1==0:
alpha=0
elif setsize_group2==0:
alpha=0
else:
u1 = np.zeros(len(y_actual)) #misclassification counting vectors for group 1 and 2 below.
u2 = np.zeros(len(y_actual))
# MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
for idx in range(0, len(set_group1)):
if set_group1[idx] == 1: #if in group 1 with label 1
if y_actual[idx] != y_pred[idx]: #if misclassified, so classified as falsely negative
u1[idx] = 1 #set counting vector idx to 1
# MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
for idx in range(0, len(set_group2)):
if set_group2[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u2[idx] = 1
alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
unfairness = alpha
return unfairness
def binary_EqOpp(y_actual, y_pred, setsP, classes, pairs):
#calculates the gap between false negative rates for both groups
if len(classes)==2: # For Binary Class
# Assume that the second class of binary class is the advantageous one, so 0 = negative, 1 = positive
pair = setsP[0]
set_group1 = pair[0]
set_group2 = pair[1]
setsize_group1 = int(sum(set_group1))
setsize_group2 = int(sum(set_group2))
# print(setsize_group1)
# print(setsize_group2)
if setsize_group1==0:
alpha=0
elif setsize_group2==0:
alpha=0
else:
u1 = np.zeros(len(y_actual))
u2 = np.zeros(len(y_actual))
# MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
for idx in range(0, len(set_group1)):
if set_group1[idx] == 1: #if in group 1
if (y_actual[idx] ==1 and y_pred[idx] ==0): #if acutal class is positive(1), but is classified as negative (0)
u1[idx] = 1 #set misclassification vector idx to 1
# MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
for idx in range(0, len(set_group2)):
if set_group2[idx] == 1:
if (y_actual[idx] ==1 and y_pred[idx] ==0):
u2[idx] = 1
alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
# print('unfairness = ', alpha)
# quit()
unfairness = alpha
return unfairness
def binary_odm(y_actual, y_pred, setsP, classes, pairs):
#Assume that the second class of binary class is the advantageous one, so 0 = negative, 1 = positive
pair = setsP[1]
set_group1 = pair[0]
set_group2 = pair[1]
setsize_group1 = int(sum(set_group1))
setsize_group2 = int(sum(set_group2))
print("Lengths:")
print("y_actual:", len(y_actual))
print("y_pred:", len(y_pred))
print("set_group1:", len(set_group1))
print("set_group2:", len(set_group2))
if setsize_group1==0:
alpha=0
elif setsize_group2==0:
alpha=0
else:
u1 = np.zeros(len(y_actual))
u2 = np.zeros(len(y_actual))
# MISSCLASSIFCATION COUNTING VECTOR FOR GROUP G=1
for idx in range(0, len(set_group1)):
if set_group1[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u1[idx] = 1
# MISCLASSIFCAITON COUTNING VECTOR FOR GROUP G'=2
for idx in range(0, len(set_group2)):
if set_group2[idx] == 1:
if y_actual[idx] != y_pred[idx]:
u2[idx] = 1
alpha = abs((1/setsize_group1)*sum(u1)-(1/setsize_group2)*sum(u2))
unfairness = alpha
return unfairness
def unfairnessLevel_multiclass(unfairness_array, classes, group_pairs):
sizeK = len(classes)
sizeD = len(group_pairs)
unfairness_helparray = unfairness_array.copy()
maxGG = []
while len(unfairness_helparray)>0:
grouparray = unfairness_helparray[0:sizeD]
maxval = max(grouparray)
maxGG.append(maxval)
temp_array = unfairness_helparray[sizeD:]
unfairness_helparray=temp_array
alpha_k = mean(maxGG)
return alpha_k