考察能否把协同过滤落到代码,理解相似度计算与近邻聚合。
要点:
import numpy as np
def cosine(u, v):
m = (u > 0) & (v > 0) # 仅在有共同评分的维度计算
if m.sum() == 0: return 0.0
return np.dot(u[m], v[m]) / (np.linalg.norm(u[m]) * np.linalg.norm(v[m]) + 1e-8)
def topn(R, uid, k=10, n=5): # R: 用户×物品评分矩阵
sims = [(cosine(R[uid], R[j]), j) for j in range(len(R)) if j != uid]
knn = sorted(sims, reverse=True)[:k]
scores = {}
for s, j in knn:
for i in range(R.shape[1]):
if R[uid, i] == 0 and R[j, i] > 0:
scores[i] = scores.get(i, 0) + s * R[j, i]
return sorted(scores, key=scores.get, reverse=True)[:n]
题目与答案就在本页;收藏、批注和错题重练在应用内