-
Notifications
You must be signed in to change notification settings - Fork 0
/
C2UCB.py
304 lines (236 loc) · 10.1 KB
/
C2UCB.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
import os
import pdb
import argparse
import time
import numpy as np
import xlwt
from tqdm import tqdm
from utils import logging
from collections import defaultdict
from sklearn.metrics.pairwise import cosine_similarity
def sigmoid(x):
return 1 / (1 + np.exp(x))
def cosine_distances(matrix1, matrix2):
matrix1_matrix2 = np.dot(matrix1, matrix2.transpose())
matrix1_norm = np.sqrt(np.multiply(matrix1, matrix1).sum(axis=1))
matrix1_norm = matrix1_norm[:, np.newaxis]
matrix2_norm = np.sqrt(np.multiply(matrix2, matrix2).sum(axis=1))
matrix2_norm = matrix2_norm[:, np.newaxis]
cosine_distance = np.divide(matrix1_matrix2, np.dot(matrix1_norm, matrix2_norm.transpose()))
return cosine_distance
def load_history_dict(file_name):
user_history = defaultdict(lambda: defaultdict(int))
with open(file_name, 'r') as inf:
for line in inf:
data = line.split("\t")
u, i, r = data[0], data[1], data[2]
user_history[int(u)][int(i)] = float(r)
return user_history
def load_data(args):
Tr = load_history_dict(args.train_file)
Te = load_history_dict(args.test_file)
user_embs = np.load(args.user_emb_file)
movie_embs = np.load(args.movie_emb_file)
movie_cate_sim = np.load(args.movie_sim_file)
return user_embs, movie_embs, movie_cate_sim, Tr, Te
def f_alpha(d, t, m, lam_da, sigma, s):
# return np.sqrt(d*np.log((1+t*m/lam_da)/sigma)) + np.sqrt(lam_da)*s
return 1.
def greedy_oracle(scores, can_items, sim, k, sigma, lam_da):
"""
sim = X.T * X
"""
kk = np.array(list(can_items))
i = np.argmax(scores[kk])
S = [kk[i]] # the first item
C = 1.0 / (sim[i, i] + sigma**(2))
for j in range(1, k):
c_set = can_items - set(S)
ii = np.array(list(c_set))
jj = np.array(S)
sigma_is = sim[ii, :][:, jj]
if j > 1:
tmp = np.sum(np.dot(sigma_is, C) * sigma_is, axis=1) + sigma**(2)
else:
tmp = C * np.sum(sigma_is * sigma_is, axis=1) + sigma**(2)
tmp = scores[ii] + 0.5 * lam_da * np.log(2 * np.pi * np.e * tmp)
k = np.argmax(tmp)
S.append(ii[k])
kk = np.array(S)
C = np.linalg.inv(sim[kk, :][:, kk] + sigma**(2) * np.identity(len(S)))
return S
def online_result(movie_embs, user_emb, id_action):
theta = 0.8 # diversity rate TODO
score_1 = None
result = []
for v in id_action:
if np.random.rand() <= 0.5:
score = np.random.rand()
else:
if score_1 is None:
score = sigmoid(user_emb.dot(movie_embs[v]))
else:
relevance = sigmoid(user_emb.dot(movie_embs[v]))
similarity = (cosine_distances(score_1, movie_embs[v][np.newaxis, :]) + 1) / 2
similarity = np.mean(similarity)
score = theta*relevance + (1-theta)*similarity
if score >= 0.7:
if score_1 is None:
score_1 = movie_embs[v][np.newaxis, :]
else:
score_1 = np.append(score_1, values=movie_embs[v][np.newaxis, :], axis=0)
result.append(1)
else:
result.append(0)
return np.array(result)
def mf_recommendation(user_emb, movie_embs, can_items, size=5):
inx = np.array(list(can_items))
scores = np.dot(user_emb, movie_embs[:, inx])
ii = np.argsort(scores)[::-1][:size]
return list(inx[ii])
def c2ucb(movie_embs, train_items, test_items, args, num, sim=None, lamb_da=100, cate_sim=None, user_emb=None):
"""
movie_embs: movie embeddings, shape (d, m)
"""
hidden_dim, num_movies = movie_embs.shape
matrix_v = lamb_da*np.identity(hidden_dim, dtype=np.float32)
vector_b = np.zeros(shape=hidden_dim, dtype=np.float32)
prec, recall, div, total_reward_vec = [], [], [], []
rec_items = []
cate_div = []
all_items = set(range(num_movies))
# can_items = all_items - set(train_items)
can_items = all_items
cur_total_reward = 0
# feature normalization
nor_embs = movie_embs.T.copy()
for i in range(num_movies):
nor_embs[i, :] = nor_embs[i, :] / np.linalg.norm(nor_embs[i, :])
for t in range(num):
alpha_t = f_alpha(d=hidden_dim, t=t, m=num_movies, sigma=args.sigma,
lam_da=args.lam_da, s=1)
inv_matrix_v = np.linalg.inv(matrix_v)
theta_hat = np.dot(inv_matrix_v, vector_b)
# compute the rating scores
r_bar = np.dot(theta_hat, movie_embs)
r_hat = np.dot(movie_embs.T, inv_matrix_v)
r_hat = alpha_t * np.sqrt(np.sum(r_hat.T * movie_embs, axis=0)) + r_bar
can_items = can_items - set(rec_items)
# get recommendation set s
if t == 0 and user_emb is not None:
s_inx = mf_recommendation(user_emb, movie_embs, can_items, size=5)
# pdb.set_trace()
else:
s_inx = greedy_oracle(r_hat, can_items, sim, args.num_recommendation, args.sigma, args.lam_da)
rec_items.extend(s_inx)
if t == 0:
s_inx0 =s_inx
# print(s_inx0)
# pdb.set_trace()
x = movie_embs[:, np.array(s_inx)]
matrix_v = matrix_v + np.dot(x, x.T)
reward = np.array([1.0 if i in test_items else 0.0 for i in s_inx])
cur_total_reward += np.sum(reward)
vector_b = vector_b + np.dot(x, reward)
# compute precision
s_test = set(list(test_items.keys()))
inter_set = set(s_inx).intersection(s_test)
prec_curr = float(len(inter_set)) / float(args.num_recommendation)
prec.append(prec_curr)
# compute recall
recall_curr = float(len(inter_set)) / float(len(s_test))
recall.append(recall_curr)
# compute diversity
div_curr = diversity(s_inx, movie_embs)
div.append(div_curr)
if cate_sim is None:
cate_div_cur = 0.0
else:
cate_div_cur = pre_diversity(s_inx, cate_sim)
cate_div.append(cate_div_cur)
total_reward_vec.append(cur_total_reward / float(len(s_test)))
return np.array(prec), np.array(recall), np.array(div), np.array(cate_div), np.array(total_reward_vec), s_inx
def diversity(s_inx, X):
"""
s_inx: the selected item set, a numpy vector
X: the item feature matrix, shape (d, m)
The similarities between items are measured using cosine similarity.
"""
S = cosine_similarity(X[:, s_inx].T)
ii, jj = np.triu_indices(len(s_inx), k=1)
vec = S[ii, jj]
div = 1 - np.mean(vec)
return div
def pre_diversity(s_inx, item_sim):
num = len(s_inx)
s = []
for i in range(num):
for j in range(i+1, num):
s.append(1 - item_sim[s_inx[i], s_inx[j]])
return sum(s) / len(s)
def eval(args):
if args.is_log:
file_name = os.path.basename(__file__)
output_path = logging(file_name, verbose=2)
user_embs, movie_embs, movie_cate_sim, Tr, Te = load_data(args)
hidden_dim, num_movies = movie_embs.shape
nor_embs = movie_embs.T.copy()
for i in range(num_movies):
nor_embs[i, :] = nor_embs[i, :] / np.linalg.norm(nor_embs[i, :])
sim_mat = np.dot(movie_embs, movie_embs.T)
lamda_list = [0.1]
# write date to excel
# file = xlwt.Workbook(encoding='ascii')
# table = file.add_sheet('cucb')
row0 = list(range(0, args.num_bandit_iter, 1))
test_users = list(Te.keys())
num_test_users = len(test_users)
for i in range(len(lamda_list)):
test_precision = np.zeros(args.num_bandit_iter)
test_recall = np.zeros(args.num_bandit_iter)
test_div = np.zeros(args.num_bandit_iter)
test_cate_div = np.zeros(args.num_bandit_iter)
test_reward = np.zeros(args.num_bandit_iter)
args.lam_da = lamda_list[i]
t1 = time.clock()
for user in test_users:
prec, recall, div, cate_div, reward, s_inx0 = c2ucb(movie_embs.T, None, Te[user],
args, num=args.num_bandit_iter,
sim=sim_mat,
cate_sim=movie_cate_sim,
user_emb=None)
print(user)
print(prec)
test_precision += prec
test_recall += recall
test_div += div
test_cate_div += cate_div
test_reward += reward
test_precision = test_precision / num_test_users
test_recall = test_recall / num_test_users
test_div = test_div / num_test_users
test_cate_div = test_cate_div / num_test_users
test_reward = test_reward / num_test_users
print("lambda:{0}\ntest_precision:{1}\ntest_recall:{2}\ntest_div:{3}\ntest_cate_div:{4}\ntest_reward:{5}".format(args.lam_da, test_precision, test_recall, test_div, test_cate_div, test_reward))
print("time used:%s\n" % (time.clock() - t1))
if __name__ == '__main__':
parser = argparse.ArgumentParser(description="c2ucb for recommendation")
parser.add_argument('--off_line_eval', default=1)
parser.add_argument('--lam_da', default=0.1)
parser.add_argument('--sigma', default=1.)
parser.add_argument('--num_recommendation', default=10)
parser.add_argument('--num_bandit_iter', default=10)
# ml-1m data
parser.add_argument('--is_log', default=False)
parser.add_argument('--train_file', default='ml_1m_user_new/ml-1m_user_0.8_train.txt',
help='the training file')
parser.add_argument('--test_file', default='ml_1m_user_new/ml-1m_user_0.8_test.txt',
help='the testing file')
parser.add_argument('--user_emb_file', default='ml_1m_user_new/bpr_ml-1m_user_0.8_dim10_user_embs.npy',
help='the user embedding file')
parser.add_argument('--movie_emb_file', default='ml_1m_user_new/bpr_ml-1m_user_0.8_dim10_item_embs.npy',
help='the movie embedding file')
parser.add_argument('--movie_sim_file', default='ml_1m_user_new/ml-1m_user_0.8_item_sim.npy',
help='the movie embedding file')
args = parser.parse_args()
eval(args)