-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathmeta_method_weight.py
More file actions
278 lines (278 loc) · 10.8 KB
/
meta_method_weight.py
File metadata and controls
278 lines (278 loc) · 10.8 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
'''
common methods used by other py files
Author: Sun Jiankai
'''
import math
#used for pprocess to get a sequence
def getSequence_from_matrix(user_item_matrix):
sequence=[]
print len(user_item_matrix)
print len(user_item_matrix[0])
for i in range(len(user_item_matrix)):
templist=[]
for j in range(len(user_item_matrix[i])):
if user_item_matrix[i][j]!=0:
templist.append((j+1,user_item_matrix[i][j]))
sequence.append((i+1,templist))
return sequence
def getSequence(testfile):
userlist=testfile.readlines()
previoususer=userlist[0].split()[0]
templist=[]
sequence=[]
for i in range(len(userlist)):
nextuser=userlist[i].split()[0]
filmid=userlist[i].split()[1]
score=userlist[i].split()[2]
if previoususer==nextuser:
templist.append((filmid,score))
else:
sequence.append((previoususer,templist))
templist=[]
previoususer=nextuser
templist.append((filmid,score))
sequence.append((previoususer,templist))
return sequence
def getSequence_1m(testfile):
userlist=testfile.readlines()
previoususer=userlist[0].split('::')[0]
templist=[]
sequence=[]
for i in range(len(userlist)):
nextuser=userlist[i].split('::')[0]
filmid=userlist[i].split('::')[1]
score=userlist[i].split('::')[2]
if previoususer==nextuser:
templist.append((filmid,score))
else:
sequence.append((previoususer,templist))
templist=[]
previoususer=nextuser
templist.append((filmid,score))
sequence.append((previoususer,templist))
return sequence
def getSequence_2(userlist):
previoususer=userlist[0].split()[0]
templist=[]
sequence=[]
for i in range(len(userlist)):
nextuser=userlist[i].split()[0]
filmid=userlist[i].split()[1]
scores=userlist[i].split()[2]
score=int(float(scores)*5)
if previoususer==nextuser:
templist.append((filmid,score))
else:
sequence.append((previoususer,templist))
templist=[]
previoususer=nextuser
templist.append((filmid,score))
sequence.append((previoususer,templist))
return sequence
def getSequence_eachmovie(userlist):
previoususer=userlist[0].split()[0]
templist=[]
sequence=[]
for i in range(len(userlist)):
nextuser=userlist[i].split()[0]
filmid=userlist[i].split()[1]
scores=userlist[i].split()[2]
score=int(float(scores)*5)
if score==0:
continue
if previoususer==nextuser:
templist.append((filmid,score))
else:
sequence.append((previoususer,templist))
templist=[]
previoususer=nextuser
templist.append((filmid,score))
sequence.append((previoususer,templist))
return sequence
#attention neighbour size and oppositeflag
#**********************
#**********************
#**********************
def select_neighbour(user_item_list,user_user_sim_list,user_id,filmid_j,filmid_k,neighbour_size,oppositeflag):
neighbour_list=[]
common_rated_user=[]
#find user that rated film j and k
for i in range(len(user_item_list)):
score_j=int(user_item_list[i].split()[filmid_j-1])
score_k=int(user_item_list[i].split()[filmid_k-1])
if score_j!=0 and score_k!=0:
#add userid=i+1 and preference to common_rated_user_list
common_rated_user.append((i+1,score_j-score_k))
#find user-user-similarity
for i in range(len(common_rated_user)):
common_rated_user_id,preference=common_rated_user[i]
if user_id<common_rated_user_id:
sim=float(user_user_sim_list[user_id-1].split()[common_rated_user_id-1])
else:
sim=float(user_user_sim_list[common_rated_user_id-1].split()[user_id-1])
neighbour_list.append((sim,preference))
#notice that we used fabs to get a neighbour
#attention
#***********************
#***********************
#***********************
if oppositeflag==True:
neighbour_list.sort(key=lambda x:(math.fabs(x[0]),math.fabs(x[1])), reverse=True)
else:
neighbour_list.sort(key=lambda x:(x[0],x[1]), reverse=True)
'''
for i in range(len(neighbour_list)):
if neighbour_list[i][0]<0:
neighbour_list=neighbour_list[0:i]
break
'''
#***********************
#***********************
#***********************
neighbour_number=min(len(neighbour_list),neighbour_size)
neighbour_list=neighbour_list[0:neighbour_number]
return neighbour_list
def select_neighbour_improved(user_list,user_user_sim_list,user_id,filmid_j,filmid_k,neighbour_size,oppositeflag):
neighbour_list=[]
common_rated_user=[]
#find user that rated film j and k
for i in range(len(user_list)):
score_j=user_list[i][filmid_j-1]
score_k=user_list[i][filmid_k-1]
if score_j!=0 and score_k!=0:
#add userid=i+1 and preference to common_rated_user_list
common_rated_user.append((i+1,score_j-score_k))
#find user-user-similarity
for i in range(len(common_rated_user)):
common_rated_user_id,preference=common_rated_user[i]
if user_id<common_rated_user_id:
sim=user_user_sim_list[user_id-1][common_rated_user_id-1]
else:
sim=user_user_sim_list[common_rated_user_id-1][user_id-1]
neighbour_list.append((sim,preference))
#notice that we used fabs to get a neighbour
#attention
#***********************
#***********************
#***********************
if oppositeflag==True:
neighbour_list.sort(key=lambda x:(math.fabs(x[0]),math.fabs(x[1])), reverse=True)
else:
neighbour_list.sort(key=lambda x:(x[0],x[1]), reverse=True)
neighbour_number=min(len(neighbour_list),neighbour_size)
neighbour_list=neighbour_list[0:neighbour_number]
return neighbour_list
def select_neighbour_by_singleitem(user_list,user_user_sim_list,user_id,filmid_j,neighbour_size,oppositeflag):
neighbour_list=[]
common_rated_user=[]
#find user that rated film j and k
for i in range(len(user_list)):
score_j=user_list[i][filmid_j-1]
if score_j!=0:
#add userid=i+1 and preference to common_rated_user_list
common_rated_user.append((i+1,score_j))
#find user-user-similarity
for i in range(len(common_rated_user)):
common_rated_user_id,preference=common_rated_user[i]
if user_id<common_rated_user_id:
sim=user_user_sim_list[user_id-1][common_rated_user_id-1]
else:
sim=user_user_sim_list[common_rated_user_id-1][user_id-1]
neighbour_list.append((sim,preference,common_rated_user_id))
#notice that we used fabs to get a neighbour
#attention
#***********************
#***********************
#***********************
if oppositeflag==True:
neighbour_list.sort(key=lambda x:(math.fabs(x[0]),math.fabs(x[1])), reverse=True)
else:
neighbour_list.sort(key=lambda x:(x[0],x[1]), reverse=True)
neighbour_number=min(len(neighbour_list),neighbour_size)
neighbour_list=neighbour_list[0:neighbour_number]
return neighbour_list
def search_pre(filmid1,filmid2,item_pairs_predict_list):
pre_j_k=-1
for i in range(len(item_pairs_predict_list)):
filmid_j=int(item_pairs_predict_list[i][1])
filmid_k=int(item_pairs_predict_list[i][2])
if filmid_j==filmid1 and filmid_k==filmid2:
pre_j_k=float(item_pairs_predict_list[i][3])
return pre_j_k
def search_filmscore(filmid,item_pairs_predict_list):
for i in range(len(item_pairs_predict_list)):
filmid_j=int(item_pairs_predict_list[i][1])
filmid_k=int(item_pairs_predict_list[i][2])
if filmid==filmid_j:
score=int(item_pairs_predict_list[i][4])
return score
if filmid==filmid_k:
score=int(item_pairs_predict_list[i][5])
return score
#greedy algorithm
def greedy_order(item_pairs_predict_list):
potential_value={}
rank_list=[]
for i in range(len(item_pairs_predict_list)):
filmid_j=int(item_pairs_predict_list[i][1])
filmid_k=int(item_pairs_predict_list[i][2])
pre_j_k=float(item_pairs_predict_list[i][3])
if potential_value.has_key(filmid_j):
potential_value[filmid_j]+=pre_j_k
else:
potential_value[filmid_j]=pre_j_k
if potential_value.has_key(filmid_k):
potential_value[filmid_k]-=pre_j_k
else:
potential_value[filmid_k]=-pre_j_k
potential_value_list=list(potential_value.items())
potential_value_list.sort(key=lambda x:(x[1],x[0]),reverse=False)
while len(potential_value_list)!=0:
max_filmid=int(potential_value_list.pop()[0])
max_filmid_score=search_filmscore(max_filmid,item_pairs_predict_list)
rank_list.append((max_filmid,max_filmid_score))
#delete max_preference film for dict
del potential_value[max_filmid]
for i in range(len(potential_value)):
filmid_j=int(potential_value.items()[i][0])
if max_filmid<filmid_j:
delta_pre=search_pre(max_filmid,filmid_j,item_pairs_predict_list)
potential_value[filmid_j]+=delta_pre
else:
delta_pre=search_pre(filmid_j,max_filmid,item_pairs_predict_list)
potential_value[filmid_j]-=delta_pre
potential_value_list=list(potential_value.items())
potential_value_list.sort(key=lambda x:(x[1],x[0]),reverse=False)
return rank_list
#source_file->matrix
def get_user_list(rate_file,user_num,item_num):
ratefile=open(rate_file,'r')
ratefilelist=ratefile.readlines()
user_list=[[0 for i in range(item_num)] for j in range(user_num)]
for i in range(len(ratefilelist)):
userid=int(ratefilelist[i].split()[0])
filmid=int(ratefilelist[i].split()[1])
score=float(ratefilelist[i].split()[2])
user_list[userid-1][filmid-1]=score
ratefile.close()
return user_list
def get_sim_list(sim_file,user_num):
simfile=open(sim_file,'r')
simfilelist=simfile.readlines()
sim_list=[[0 for i in range(user_num)] for j in range(user_num)]
for i in range(len(simfilelist)):
user_sim_list=simfilelist[i].split()
for j in range(len(user_sim_list)):
sim=float(user_sim_list[j])
sim_list[i][j]=sim
simfile.close()
return sim_list
def get_avg_score_list(avg_score_file):
avgfile=open(avg_score_file,'r')
avgfilelist=avgfile.readlines()
avg_list=[]
for i in range(len(avgfilelist)):
avg=float(avgfilelist[i].split()[0])
avg_list.append(avg)
avgfile.close()
return avg_list