-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathUserCF.py
More file actions
executable file
·62 lines (58 loc) · 1.25 KB
/
UserCF.py
File metadata and controls
executable file
·62 lines (58 loc) · 1.25 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
from read import *
import math
from operator import itemgetter, attrgetter
def UserSimilarity(train):
# build inverse tatble for iterm_users
item_users = dict()
for u, items in train.items():
for i in items.keys():
if i not in item_users:
item_users[i] = set()
item_users[i].add(u)
C = dict()
N = dict()
for i, users in item_users.items():
for u in users:
if N.has_key(u):
N[u] += 1
else:
N[u] = 1
if C.has_key(u):
pass
else:
C[u] = {}
for v in users:
if u == v:
continue
if C[u].has_key(v):
C[u][v] += 1
else:
C[u][v] = 1
W = dict()
for u, related_users in C.items():
W[u] = dict()
for v, cuv in related_users.items():
W[u][v] = cuv / math.sqrt(N[u]*N[v])
return W
def Recommend(user,train,W,K):
rank = dict()
interacted_items = train[user].keys()
l = sorted(W[user].items(),key=itemgetter(1),reverse=True)
for v, wuv in l[0:K]:
for i, rvi in train[v].items():
if i in interacted_items:
continue
if not rank.has_key(i):
rank[i] = 0
rank[i] += wuv * rvi
return rank
def main():
data = ReadData("test.base")
print data
idata = ImplicitData(data)
print idata
W = UserSimilarity(idata)
print W
print Recommend('1',idata,W,3)
if __name__=='__main__':
main()