-
Notifications
You must be signed in to change notification settings - Fork 5
Expand file tree
/
Copy pathutils.py
More file actions
377 lines (294 loc) · 17.3 KB
/
Copy pathutils.py
File metadata and controls
377 lines (294 loc) · 17.3 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
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
import pickle
import numpy as np
import pickle as pkl
from collections import defaultdict
import random
import json
# from sklearn.metrics.pairwise import euclidean_distances
# from diversity_baselines import MMR, DPP
def normalize(v):
v = np.array(v)
norm = np.linalg.norm(v)
if norm == 0:
return v
return v / norm
def softmax(x):
x = x - np.max(x)
exp_x = np.exp(x)
softmax_x = exp_x / np.sum(exp_x)
return softmax_x
def get_batch(data, batch_size, batch_no):
return data[batch_size * batch_no: batch_size * (batch_no + 1)]
def get_aggregated_batch(data, batch_size, batch_no):
return [data[d][batch_size * batch_no: batch_size * (batch_no + 1)] for d in range(len(data))]
def padding_list(seq, max_len):
spar_ft, dens_ft = seq
seq_length = min(len(spar_ft), max_len)
if len(spar_ft) < max_len or len(dens_ft) < max_len:
spar_ft += [np.zeros_like(np.array(spar_ft[0])).tolist()] * (max_len - len(spar_ft))
dens_ft += [np.zeros_like(np.array(dens_ft[0])).tolist()] * (max_len - len(dens_ft))
return spar_ft[:max_len], dens_ft[:max_len], seq_length
def load_parse_from_json(parse, setting_path):
with open(setting_path, 'r') as f:
setting = json.load(f)
parse_dict = vars(parse)
for k, v in setting.items():
parse_dict[k] = v
return parse
def construct_behavior_data(data, max_len):
target_user, target_item_dens, target_item_spar, user_behavior_dens, user_behavior_spar, label, seq_len, list_len, tiled_seq_len = [], [], [], [], [], [], [], [], []
for d in data:
uid, spar_ft, dens_ft, hist_spar, hist_dens, lb = d
target_item_dens.extend(dens_ft)
target_item_spar.extend(spar_ft)
length = min(len(hist_spar), max_len)
if len(hist_spar) < max_len:
hist_spar = hist_spar + [np.zeros_like(np.array(hist_spar[0])).tolist()] * (max_len - len(hist_spar))
hist_dens = hist_dens + [np.zeros_like(np.array(hist_dens[0])).tolist()] * (max_len - len(hist_dens))
for i in range(len(lb)):
target_user.append(uid)
user_behavior_dens.append(hist_dens[:max_len])
user_behavior_spar.append(hist_spar[:max_len])
tiled_seq_len.append(length)
label.extend(lb)
seq_len.append(length)
list_len.append(len(lb))
print(target_item_spar[-1], label[-30:], len(target_item_spar), len(list_len), sum(list_len))
# if len(target_item_spar) != sum(list_len):
# print('not equal')
return target_user, target_item_spar, target_item_dens, user_behavior_spar, user_behavior_dens, label, seq_len, list_len, tiled_seq_len
def rank(data, preds, out_file, max_behavior_len):
users, item_spars, item_denss, user_spars, user_denss, labels, seq_lens, list_lens, tiled_seq_len = data
# print('origin', item_spars[-1], labels[-30:], len(item_spars), len(list_lens), sum(list_lens), len(preds))
out_user, out_itm_spar, out_itm_dens, out_usr_spar, out_usr_dens, out_label, out_pos = [], [], [], [], [], [], []
idx = 0
for i, length in enumerate(list_lens):
item_spar, item_dens = item_spars[idx: idx + length], item_denss[idx: idx + length]
user_spar, user_dens = user_spars[idx], user_denss[idx]
label, pred = labels[idx: idx + length], preds[idx: idx + length]
rerank_idx = sorted(list(range(len(pred))), key=lambda k: pred[k], reverse=True)
out_user.append(users[i])
out_itm_spar.append(np.array(item_spar)[rerank_idx].tolist())
out_itm_dens.append(np.array(item_dens)[rerank_idx].tolist())
out_usr_spar.append(user_spar)
out_usr_dens.append(user_dens)
out_label.append(np.array(label)[rerank_idx].tolist())
out_pos.append(np.arange(length)[rerank_idx].tolist())
idx += length
with open(out_file, 'wb') as f:
pickle.dump([out_user, out_itm_spar, out_itm_dens, out_usr_spar, out_usr_dens, out_label, out_pos, list_lens, seq_lens], f)
def get_last_click_pos(my_list):
if sum(my_list) == 0 or sum(my_list) == len(my_list):
return len(my_list) - 1
return max([index for index, el in enumerate(my_list) if el])
def construct_list(data_dir, max_time_len, max_seq_len, props, use_pos=True):
user, itm_spar, itm_dens, usr_spar, usr_dens, label, pos, list_len, seq_len = pickle.load(open(data_dir, 'rb'))
cut_itm_dens, cut_itm_spar, cut_label, cut_pos, cut_usr_spar, cut_usr_dens, de_label, cut_hist_pos = [], [], [], [], [], [], [], []
for i, itm_spar_i, itm_dens_i, usr_spar_i, usr_dens_i, label_i, pos_i, list_len_i, seq_len_i in zip(list(range(len(label))),
itm_spar, itm_dens, usr_spar, usr_dens, label, pos, list_len, seq_len):
de_lb = []
for j in range(len(label_i)):
de_lb.append(label_i[j] / props[itm_spar_i[j][1]][pos_i[j]])
if len(itm_spar_i) >= max_time_len:
cut_itm_spar.append(itm_spar_i[: max_time_len])
cut_itm_dens.append(itm_dens_i[: max_time_len])
cut_label.append(label_i[: max_time_len])
de_label.append(de_lb[: max_time_len])
cut_pos.append(pos_i[: max_time_len])
list_len[i] = max_time_len
else:
cut_itm_spar.append(itm_spar_i + [np.zeros_like(np.array(itm_spar_i[0])).tolist()] * (max_time_len - len(itm_spar_i)))
cut_itm_dens.append(itm_dens_i + [np.zeros_like(np.array(itm_dens_i[0])).tolist()] * (max_time_len - len(itm_dens_i)))
cut_label.append(label_i + [0 for _ in range(max_time_len - list_len_i)])
de_label.append(de_lb + [0 for _ in range(max_time_len - list_len_i)])
cut_pos.append(pos_i + [j for j in range(list_len_i, max_time_len)])
if len(usr_spar_i) >= max_seq_len:
cut_usr_spar.append(usr_spar_i[:max_seq_len])
cut_usr_dens.append(usr_dens_i[:max_seq_len])
seq_len[i] = max_seq_len
else:
cut_usr_spar.append(usr_spar_i + [np.zeros_like(np.array(usr_spar_i[0])).tolist()] * (max_seq_len - len(usr_spar_i)))
cut_usr_dens.append(usr_dens_i + [np.zeros_like(np.array(usr_dens_i[0])).tolist()] * (max_seq_len - len(usr_dens_i)))
if use_pos:
cut_hist_pos.append([j for j in range(max_seq_len)])
else:
cut_hist_pos.append(np.reshape(cut_usr_dens[-1], [-1]))
return user, cut_itm_spar, cut_itm_dens, cut_usr_spar, cut_usr_dens, cut_label, cut_hist_pos, list_len, seq_len, cut_pos, de_label
def construct_list_with_profile(data_dir, max_time_len, max_seq_len, props, profile, use_pos=True):
user, itm_spar, itm_dens, usr_spar, usr_dens, label, pos, list_len, seq_len = pickle.load(open(data_dir, 'rb'))
print(len(user))
print('max time len', max_time_len, 'max seq len', max_seq_len)
max_interval, min_interval = 0, 1e9
cut_itm_dens, cut_itm_spar, cut_label, cut_pos, cut_usr_spar, cut_usr_dens, de_label, user_prof, cut_hist_pos = [], [], [], [], [], [], [], [], []
for i, itm_spar_i, itm_dens_i, usr_spar_i, usr_dens_i, label_i, pos_i, list_len_i, seq_len_i in zip(list(range(len(label))),
itm_spar, itm_dens, usr_spar, usr_dens, label, pos, list_len, seq_len):
user_prof.append(profile[user[i]])
de_lb = []
for j in range(len(label_i)):
de_lb.append(label_i[j] / props[itm_spar_i[j][1]][pos_i[j]])
if len(itm_spar_i) >= max_time_len:
cut_itm_spar.append(itm_spar_i[: max_time_len])
cut_itm_dens.append(itm_dens_i[: max_time_len])
cut_label.append(label_i[: max_time_len])
de_label.append(de_lb[: max_time_len])
cut_pos.append(pos_i[: max_time_len])
list_len[i] = max_time_len
else:
cut_itm_spar.append(itm_spar_i + [np.zeros_like(np.array(itm_spar_i[0])).tolist()] * (max_time_len - len(itm_spar_i)))
cut_itm_dens.append(itm_dens_i + [np.zeros_like(np.array(itm_dens_i[0])).tolist()] * (max_time_len - len(itm_dens_i)))
# cut_itm_spar.append([np.zeros_like(np.array(itm_spar_i[0])).tolist()] * max_time_len)
# cut_itm_dens.append([np.zeros_like(np.array(itm_dens_i[0])).tolist()] * max_time_len)
cut_label.append(label_i + [0 for _ in range(max_time_len - list_len_i)])
de_label.append(de_lb + [0 for _ in range(max_time_len - list_len_i)])
cut_pos.append(pos_i + [j for j in range(list_len_i, max_time_len)])
if len(usr_spar_i) >= max_seq_len:
cut_usr_spar.append(usr_spar_i[:max_seq_len])
cut_usr_dens.append(usr_dens_i[:max_seq_len])
seq_len[i] = max_seq_len
else:
cut_usr_spar.append(
usr_spar_i + [np.zeros_like(np.array(usr_spar_i[0])).tolist()] * (max_seq_len - len(usr_spar_i)))
cut_usr_dens.append(
usr_dens_i + [np.zeros_like(np.array(usr_dens_i[0])).tolist()] * (max_seq_len - len(usr_dens_i)))
if use_pos:
cut_hist_pos.append([j for j in range(max_seq_len)])
else:
usr_dens_i = np.log2(np.array(usr_dens_i) + 1)
lst = np.reshape(np.array(usr_dens_i[:seq_len_i]), [-1]).tolist() #1
hist_pos = lst + [max(lst) + 1 for i in range(seq_len_i, max_seq_len)]
cut_hist_pos.append(hist_pos[:max_seq_len])
max_interval = max(max_interval, max(cut_hist_pos[-1]))
min_interval = min(min_interval, min(cut_hist_pos[-1]))
print(max_interval, min_interval)
return user_prof, cut_itm_spar, cut_itm_dens, cut_usr_spar, cut_usr_dens, cut_label, cut_hist_pos, list_len, seq_len, cut_pos, de_label
def get_sim_hist(profile_group, usr_profile):
comm = profile_group[0][usr_profile[0]]
idx = 1
while idx < len(usr_profile):
tmp = comm & profile_group[idx][usr_profile[idx]]
idx += 1
if not tmp:
break
comm = tmp
return random.choice(list(comm))
def construct_list_with_profile_sim_hist(data_dir, max_time_len, max_seq_len, props, profile, profile_fnum, use_pos=True):
user, itm_spar, itm_dens, usr_spar, usr_dens, label, pos, list_len, seq_len = pickle.load(open(data_dir, 'rb'))
profile_group = [defaultdict(set) for _ in range(profile_fnum)]
for u in range(len(user)):
usr_prof = profile[user[u]]
for i in range(profile_fnum):
profile_group[i][usr_prof[i]].add(u)
print(len(user))
print('max time len', max_time_len, 'max seq len', max_seq_len)
max_interval, min_interval = 0, 1e9
cut_itm_dens, cut_itm_spar, cut_label, cut_pos, cut_usr_spar, cut_usr_dens, de_label, user_prof, cut_hist_pos = [], [], [], [], [], [], [], [], []
for i, itm_spar_i, itm_dens_i, label_i, pos_i, list_len_i, seq_len_i in zip(list(range(len(label))),
itm_spar, itm_dens, label, pos, list_len, seq_len):
user_prof.append(profile[user[i]])
sim_id = get_sim_hist(profile_group, user_prof[-1])
usr_dens_i, usr_spar_i = usr_dens[sim_id], usr_spar[sim_id]
de_lb = []
for j in range(len(label_i)):
de_lb.append(label_i[j] / props[itm_spar_i[j][1]][pos_i[j]])
if len(itm_spar_i) >= max_time_len:
cut_itm_spar.append(itm_spar_i[: max_time_len])
cut_itm_dens.append(itm_dens_i[: max_time_len])
cut_label.append(label_i[: max_time_len])
de_label.append(de_lb[: max_time_len])
cut_pos.append(pos_i[: max_time_len])
list_len[i] = max_time_len
else:
cut_itm_spar.append(itm_spar_i + [np.zeros_like(np.array(itm_spar_i[0])).tolist()] * (max_time_len - len(itm_spar_i)))
cut_itm_dens.append(itm_dens_i + [np.zeros_like(np.array(itm_dens_i[0])).tolist()] * (max_time_len - len(itm_dens_i)))
# cut_itm_spar.append([np.zeros_like(np.array(itm_spar_i[0])).tolist()] * max_time_len)
# cut_itm_dens.append([np.zeros_like(np.array(itm_dens_i[0])).tolist()] * max_time_len)
cut_label.append(label_i + [0 for _ in range(max_time_len - list_len_i)])
de_label.append(de_lb + [0 for _ in range(max_time_len - list_len_i)])
cut_pos.append(pos_i + [j for j in range(list_len_i, max_time_len)])
if len(usr_spar_i) >= max_seq_len:
cut_usr_spar.append(usr_spar_i[:max_seq_len])
cut_usr_dens.append(usr_dens_i[:max_seq_len])
seq_len[i] = max_seq_len
else:
cut_usr_spar.append(
usr_spar_i + [np.zeros_like(np.array(usr_spar_i[0])).tolist()] * (max_seq_len - len(usr_spar_i)))
cut_usr_dens.append(
usr_dens_i + [np.zeros_like(np.array(usr_dens_i[0])).tolist()] * (max_seq_len - len(usr_dens_i)))
if use_pos:
cut_hist_pos.append([j for j in range(max_seq_len)])
else:
usr_dens_i = np.log2(np.array(usr_dens_i) + 1)
lst = np.reshape(np.array(usr_dens_i[:seq_len_i]), [-1]).tolist() #1
hist_pos = lst + [max(lst) + 1 for i in range(seq_len_i, max_seq_len)]
cut_hist_pos.append(hist_pos[:max_seq_len])
max_interval = max(max_interval, max(cut_hist_pos[-1]))
min_interval = min(min_interval, min(cut_hist_pos[-1]))
print(max_interval, min_interval)
return user_prof, cut_itm_spar, cut_itm_dens, cut_usr_spar, cut_usr_dens, cut_label, cut_hist_pos, list_len, seq_len, cut_pos, de_label
def rerank(attracts, terms):
val = np.array(attracts) * np.array(np.ones_like(terms))
return sorted(range(len(val)), key=lambda k: val[k], reverse=True)
def evaluate(labels, preds, scope_number, props, cates, poss, is_rank):
ndcg, utility, map, clicks = [], [], [], []
for label, pred, cate, pos in zip(labels, preds, cates, poss):
if is_rank:
final = sorted(range(len(pred)), key=lambda k: pred[k], reverse=True)
else:
final = list(range(len(pred)))
click = np.array(label)[final].tolist() # reranked labels
gold = sorted(range(len(click)), key=lambda k: click[k], reverse=True) # optimal list for ndcg
ideal_dcg, dcg, AP_value, AP_count, util = 0, 0, 0, 0, 0
scope_number = min(scope_number, len(label))
scope_gold = gold[:scope_number]
for _i, _g, _f in zip(range(1, scope_number + 1), scope_gold, final[scope_number:]):
dcg += (pow(2, click[_i - 1]) - 1) / (np.log2(_i + 1))
ideal_dcg += (pow(2, click[_g]) - 1) / (np.log2(_i + 1))
if click[_i] >= 1:
AP_count += 1
AP_value += AP_count / _i
util += click[_i] * props[cate[_f]][_i]/props[cate[_f]][pos[_f]]
_ndcg = float(dcg) / ideal_dcg if ideal_dcg != 0 else 0.
_map = float(AP_value) / AP_count if AP_count != 0 else 0.
ndcg.append(_ndcg)
map.append(_map)
utility.append(util)
clicks.append(sum(clicks[:scope_number]))
return np.mean(np.array(map)), np.mean(np.array(ndcg)), np.mean(np.array(clicks)), np.mean(np.array(utility)), \
[map, ndcg, clicks, utility]
def evaluate_multi(labels, preds, scope_number, props, cates, poss, is_rank, _print=False):
ndcg, utility, map, clicks, de_ndcg = [[] for _ in range(len(scope_number))], \
[[] for _ in range(len(scope_number))], [[] for _ in range(len(scope_number))], \
[[] for _ in range(len(scope_number))], [[] for _ in range(len(scope_number))]
if _print:
_print = 5
for label, pred, cate, pos in zip(labels, preds, cates, poss):
if is_rank:
final = sorted(range(len(pred)), key=lambda k: pred[k], reverse=True)
else:
final = list(range(len(pred)))
click = np.array(label)[final].tolist() # reranked labels
gold = sorted(range(len(label)), key=lambda k: label[k], reverse=True) # optimal list for ndcg
for i, scope in enumerate(scope_number):
ideal_dcg, dcg, de_dcg, de_idcg, AP_value, AP_count, util = 0, 0, 0, 0, 0, 0, 0
cur_scope = min(scope, len(label))
for _i, _g, _f in zip(range(1, cur_scope + 1), gold[:cur_scope], final[:cur_scope]):
dcg += (pow(2, click[_i - 1]) - 1) / (np.log2(_i + 1))
ideal_dcg += (pow(2, label[_g]) - 1) / (np.log2(_i + 1))
de_dcg += (pow(2, click[_i - 1]) - 1) / (np.log2(_i + 1) * props[cate[_f]][pos[_f]])
de_idcg += (pow(2, label[_g]) - 1) / (np.log2(_i + 1) * props[cate[_g]][pos[_g]])
if click[_i - 1] >= 1:
AP_count += 1
AP_value += AP_count / _i
util += click[_i - 1] * props[cate[_f]][_i - 1] / props[cate[_f]][pos[_f]]
_ndcg = float(dcg) / ideal_dcg if ideal_dcg != 0 else 0.
_map = float(AP_value) / AP_count if AP_count != 0 else 0.
_de_ndcg = float(de_dcg) / de_idcg if de_idcg != 0 else 0.
ndcg[i].append(_ndcg)
de_ndcg[i].append(_de_ndcg)
map[i].append(_map)
utility[i].append(util)
clicks[i].append(sum(click[:cur_scope]))
_print -= 1
return np.mean(np.array(map), axis=-1), np.mean(np.array(ndcg), axis=-1), \
np.mean(np.array(de_ndcg), axis=-1), np.mean(np.array(clicks), axis=-1), \
np.mean(np.array(utility), axis=-1), [map, ndcg, de_ndcg, clicks, utility]