-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathclr.py
More file actions
143 lines (126 loc) · 5 KB
/
clr.py
File metadata and controls
143 lines (126 loc) · 5 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
from __future__ import print_function
from builtins import range
import numpy as np
from sklearn.metrics import r2_score, mean_squared_error as mse_score
from sklearn.linear_model import Ridge, LinearRegression
from sklearn.base import clone
import scipy.sparse as ssp
def reassign_labels(scores, constr):
if constr is None:
return np.argmin(scores, axis=1)
labels = np.empty(scores.shape[0], dtype=np.int)
# TODO: make faster?
for c_id in range(constr.max() + 1):
labels[constr == c_id] = np.argmin(np.mean(scores[constr == c_id], axis=0))
return labels
# this is slower than a loop
#def reassign_labels_vect(scores, constr):
# constr_size = constr.max() + 1
# big_idx = constr[:,np.newaxis] == np.arange(constr_size)
# arg_min = np.argmin((np.broadcast_to(scores[:,np.newaxis],
# (scores.shape[0], constr_size, scores.shape[1])) *
# big_idx[:,:,np.newaxis]).sum(axis=0) /
# big_idx.sum(axis=0)[:,np.newaxis], axis=1)
# return np.sum(big_idx * arg_min, axis=1)
def fuzzy_clr(X, y, k, kmeans_X=0.0,
max_iter=5, verbose=0, lr=None):
if lr is None:
lr = Ridge(alpha=1e-5)
models = [clone(lr) for i in range(k)]
q = np.random.rand(X.shape[0], k)
q /= np.sum(q, axis=1, keepdims=True)
sigma_sq = np.empty(k)
lmbda = np.empty(k)
centers = np.empty((k, X.shape[1]))
probs = np.empty((X.shape[0], k))
for it in range(max_iter):
# M step
for cl_idx in range(k):
q_sqrt = np.sqrt(q[:, cl_idx])
models[cl_idx].fit(q_sqrt[:,np.newaxis] * X, q_sqrt * y)
q_sum = np.sum(q[:, cl_idx])
centers[cl_idx] = np.sum(q[:, cl_idx:cl_idx+1] * X, axis=0) / q_sum
lmbda[cl_idx] = q_sum / X.shape[0]
sigma_sq[cl_idx] = np.sum(q[:, cl_idx] * (
(y - models[cl_idx].predict(X)) ** 2 +
kmeans_X * np.sum((X - centers[cl_idx]) ** 2, axis=1)
))
sigma_sq[cl_idx] /= q_sum
# E step
q_prev = q.copy()
for cl_idx in range(k):
probs[:, cl_idx] = np.exp((
-(y - models[cl_idx].predict(X)) ** 2 -
kmeans_X * np.sum((X - centers[cl_idx]) ** 2, axis=1)
) / (2 * sigma_sq[cl_idx])) / np.sqrt(np.pi * 2.0 * sigma_sq[cl_idx])
q[:, cl_idx] = lmbda[cl_idx] * probs[:, cl_idx]
q /= q.sum(axis=1, keepdims=True)
if verbose > 1:
loglike = -np.sum(np.log(np.sum(lmbda * probs, axis=1)))
print("Iter #{}: loglike = {:.6f}".format(it, loglike))
if np.allclose(q_prev, q, atol=1e-5):
break
loglike = -np.sum(np.log(np.sum(lmbda * probs, axis=1)))
if verbose == 1:
print("Iter #{}: loglike = {:.6f}".format(it, loglike))
labels = np.argmax(q, axis=1)
for cl_idx in range(k):
if np.sum(labels == cl_idx) == 0:
continue
models[cl_idx].fit(X[labels == cl_idx], y[labels == cl_idx])
return labels, models, lmbda, loglike
def clr(X, y, k, kmeans_X=0.0, constr=None, lr=None,
max_iter=5, labels=None, verbose=0):
if labels is None:
labels = np.random.choice(k, size=X.shape[0])
if lr is None:
lr = Ridge(alpha=1e-5)
models = [clone(lr) for i in range(k)]
scores = np.empty((X.shape[0], k))
preds = np.empty((X.shape[0], k))
for it in range(max_iter):
# rebuild models
for cl_idx in range(k):
if np.sum(labels == cl_idx) == 0:
continue
models[cl_idx].fit(X[labels == cl_idx], y[labels == cl_idx])
# reassign points
for cl_idx in range(k):
preds[:, cl_idx] = models[cl_idx].predict(X)
scores[:, cl_idx] = (y - preds[:, cl_idx]) ** 2
# TODO: do something when cluster vanishes?
if np.sum(labels == cl_idx) == 0:
continue
if kmeans_X > 0:
center = np.mean(X[labels == cl_idx], axis=0)
scores[:, cl_idx] += kmeans_X * np.asarray(np.sum(np.square(X - center), axis=1)).squeeze()
labels_prev = labels.copy()
labels = reassign_labels(scores, constr)
if verbose > 1:
corr_preds = preds[np.arange(preds.shape[0]), labels]
print("Iter #{}: obj = {:.6f}, MSE = {:.6f}, r2 = {:.6f}".format(
it, np.mean(scores[np.arange(preds.shape[0]), labels]),
mse_score(y, corr_preds), r2_score(y, corr_preds),
))
if np.allclose(labels, labels_prev):
break
obj = np.mean(scores[np.arange(preds.shape[0]), labels])
if verbose == 1:
corr_preds = preds[np.arange(preds.shape[0]), labels]
print("Iter #{}: obj = {:.6f}, MSE = {:.6f}, r2 = {:.6f}".format(
it, obj, mse_score(y, corr_preds), r2_score(y, corr_preds),
))
weights = (labels == np.arange(k)[:,np.newaxis]).sum(axis=1).astype(np.float)
weights /= np.sum(weights)
return labels, models, weights, obj
def best_clr(X, y, k, fuzzy=False, num_tries=10, **kwargs):
clr_func = fuzzy_clr if fuzzy else clr
best_obj = np.inf
for i in range(num_tries):
labels, models, weights, obj = clr_func(X, y, k, **kwargs)
if obj < best_obj:
best_obj = obj
best_labels = labels
best_models = models
best_weights = weights
return best_labels, best_models, best_weights, best_obj