-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBayesian_Classifier.py
More file actions
240 lines (188 loc) · 8.18 KB
/
Copy pathBayesian_Classifier.py
File metadata and controls
240 lines (188 loc) · 8.18 KB
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
import numpy as np
# Modified Lab 2 Code
def compute_priors_lab2(y):
priors = {}
total_samples = len(y)
for label in y:
priors[label] = priors.get(label, 0) + 1
sorted_labels = sorted(priors.keys())
priors = {f"{y.name}={label}": priors[label] / total_samples for label in sorted_labels}
return priors
def specific_class_conditional_lab2(x, xv, y, yv):
count = np.sum((x == xv) & (y == yv))
total_samples = np.sum(y == yv)
if count != 0:
prob = count / total_samples
else:
prob = 0.01
return prob
def class_conditional_lab2(X, y):
probs = {}
y_values = np.unique(y)
for feature in X.columns:
feature_values = np.unique(X[feature])
for value in feature_values:
condition = f"{feature}={value}"
for y_value in y_values:
condition_key = f"{condition}|{y.name}={y_value}"
probs[condition_key] = specific_class_conditional_lab2(X[feature], value, y, y_value)
return probs
def posteriors(probs, priors, x):
likelihoods = {}
cond_list = "|" + ",".join(f"{key}={(x[key])}" for key in x.keys())
for class_label in priors.keys():
likelihood = 1.0
for key in x.keys():
likelihood *= probs.get(f'{key}={(x[key])}|{class_label}', 0)
likelihoods[class_label] = likelihood
denominator = sum(likelihoods.values())
# Check if the denominator is zero or very small (numerically unstable)
if denominator <= np.finfo(float).eps:
# Set posterior probabilities to 0.5 for all class labels if the combination doesn't exist or has very low probability
post_probs = {f'{label}{cond_list}': 0.5 for label in priors.keys()}
else:
# Calculate posterior probabilities normally
post_probs = {f'{label}{cond_list}': likelihoods[label] * priors[label] / denominator for label in priors.keys()}
return post_probs
def train_test_split(X, y, test_frac=0.5):
inxs = list(range(len(y)))
np.random.shuffle(inxs)
X = X.iloc[inxs, :]
y = y.iloc[inxs]
split_index = int(len(y) * test_frac)
Xtrain, ytrain = X.iloc[:-split_index, :], y.iloc[:-split_index]
Xtest, ytest = X.iloc[-split_index:, :], y.iloc[-split_index:]
return Xtrain, ytrain, Xtest, ytest
def exercise_6_lab2(Xtrain, ytrain, Xtest, ytest, prior_type='uniform'):
priors = compute_priors_lab2(ytrain)
probs = class_conditional_lab2(Xtrain, ytrain)
correct_predictions = 0
for i in range(len(Xtest)):
x = Xtest.iloc[i, :]
post_probs = posteriors(probs, priors, x)
predicted_class = max(post_probs, key=post_probs.get)
if predicted_class.split("|")[0].strip().split("=")[1] == ytest.iloc[i]: # Compare predicted_class as string
correct_predictions += 1
accuracy = correct_predictions / len(Xtest)
return accuracy
def exercise_7_lab2(Xtrain, ytrain, Xtest, ytest, npermutations=10):
# Initialize the dictionary to store importances
importances = {}
for col in Xtrain.columns:
importances[col] = 0
# Find the original accuracy
orig_accuracy = exercise_6_lab2(Xtrain, ytrain, Xtest, ytest)
# Carry out feature importance calculations
for col in Xtrain.columns:
for perm in range(npermutations):
Xtest2 = Xtest.copy()
Xtest2[col] = Xtest2[col].sample(frac=1, replace=False).values
accuracy = exercise_6_lab2(Xtrain, ytrain, Xtest2, ytest)
importances[col] += orig_accuracy - accuracy
# Calculate the average importance
importances[col] /= npermutations
return importances
def exercise_8_lab2(Xtrain, ytrain, Xtest, ytest, npermutations=20):
# initialize what we are going to return
importances = {}
for col in Xtrain.columns:
importances[col] = 0
# find the original accuracy
orig_accuracy = exercise_6_lab2(Xtrain, ytrain, Xtest, ytest)
# now carry out the feature importance work
for col in Xtrain.columns:
for perm in range(npermutations):
Xtrain2 = Xtrain.copy()
Xtrain2[col] = Xtrain[col].sample(frac=1, replace=False).values
# Train and evaluate the Bayesian classifier with the modified feature
accuracy = exercise_6_lab2(Xtrain2, ytrain, Xtest, ytest)
importances[col] += orig_accuracy - accuracy
for col in Xtrain.columns:
importances[col] = importances[col] / npermutations
return importances
# Gaussian Code
def compute_priors(y, prior_type='uniform'):
priors = {}
total_samples = len(y)
if prior_type == 'uniform':
prior_value = 1 / len(np.unique(y))
for label in y:
priors[f"{y.name}={label}"] = prior_value
elif prior_type == 'empirical':
for label in y:
priors[label] = priors.get(label, 0) + 1
priors = {f"{y.name}={label}": priors[label] / total_samples for label in priors.keys()}
else:
raise ValueError("Invalid prior_type. Use 'uniform' or 'empirical'.")
return priors
def gaussian_likelihood(x, mean, std):
exponent = -0.5 * ((x - mean) / std) ** 2
return (1 / (np.sqrt(2 * np.pi) * std)) * np.exp(exponent)
def class_conditional_gaussian(X, y):
class_cond_probs = {}
for y_value in np.unique(y):
X_given_y = X[y == y_value]
class_cond_probs[f"{y.name}={y_value}"] = {
feature: {
'mean': np.mean(X_given_y[feature]),
'std': np.std(X_given_y[feature]) + 0.0001
}
for feature in X.columns
}
return class_cond_probs
def posteriors_gaussian(class_cond_probs, priors, x):
post_probs = {}
for y_value in class_cond_probs.keys():
posterior = priors[y_value]
for feature in x.keys():
likelihood = gaussian_likelihood(x[feature], class_cond_probs[y_value][feature]['mean'], class_cond_probs[y_value][feature]['std'])
posterior *= likelihood
post_probs[y_value] = posterior
return post_probs
def exercise_6_gaussian(Xtrain, ytrain, Xtest, ytest, prior_type='uniform'):
priors = compute_priors(ytrain, prior_type)
class_cond_probs = class_conditional_gaussian(Xtrain, ytrain)
correct_predictions = 0
for i in range(len(Xtest)):
x = Xtest.iloc[i, :]
post_probs = posteriors_gaussian(class_cond_probs, priors, x)
predicted_class = max(post_probs, key=post_probs.get)
if predicted_class.split("=")[1] == ytest.iloc[i]:
correct_predictions += 1
accuracy = correct_predictions / len(Xtest)
return accuracy
def exercise_7_gaussian(Xtrain, ytrain, Xtest, ytest, npermutations=10):
# Initialize the dictionary to store importances
importances = {}
for col in Xtrain.columns:
importances[col] = 0
# Find the original accuracy
orig_accuracy = exercise_6_gaussian(Xtrain, ytrain, Xtest, ytest)
# Carry out feature importance calculations
for col in Xtrain.columns:
for perm in range(npermutations):
Xtest2 = Xtest.copy()
Xtest2[col] = Xtest2[col].sample(frac=1, replace=False).values
accuracy = exercise_6_gaussian(Xtrain, ytrain, Xtest2, ytest)
importances[col] += orig_accuracy - accuracy
# Calculate the average importance
importances[col] /= npermutations
return importances
def exercise_8_gaussian(Xtrain, ytrain, Xtest, ytest, npermutations=20):
# initialize what we are going to return
importances = {}
for col in Xtrain.columns:
importances[col] = 0
# find the original accuracy
orig_accuracy = exercise_6_gaussian(Xtrain, ytrain, Xtest, ytest)
# now carry out the feature importance work
for col in Xtrain.columns:
for perm in range(npermutations):
Xtrain2 = Xtrain.copy()
Xtrain2[col] = Xtrain[col].sample(frac=1, replace=False).values
# Train and evaluate the Bayesian classifier with the modified feature
accuracy = exercise_6_gaussian(Xtrain2, ytrain, Xtest, ytest)
importances[col] += orig_accuracy - accuracy
for col in Xtrain.columns:
importances[col] = importances[col] / npermutations
return importances