推荐算法: SVD协同过滤 代码实现


SVD协同过滤代码实现

原理部分
github链接(有数据集)

预测方程及随机梯度下降推导

参数可由求解以下最优化问题得到:

对其使用随机梯度下降法,令 $e_{ui} = r_{ui} - \hat{r}_{ui}$,求对各个变量的偏导:

  • 对 $b_u$ 的偏导:$-2e_{ui} + 2\lambda b_u$
  • 对 $b_i$ 的偏导:$-2e_{ui} + 2\lambda b_i$
  • 对 $p_u$ 的偏导:$-2e_{ui} * p_i + 2\lambda p_u$
  • 对 $p_i$ 的偏导:$-2e_{ui} * p_u + 2\lambda p_i$

故,随机梯度下降为:

  • $b_u’ = b_u + \gamma(e_{ui} - \lambda b_u)$
  • $b_i’ = b_i + \gamma(e_{ui} - \lambda b_i)$
  • $p_u’ = p_u + \gamma(e_{ui} * p_i - \lambda p_u)$
  • $p_i’ = p_i + \gamma(e_{ui} * p_u - \lambda p_i)$

代码

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
import numpy as np
import random
import os


class SVD:
def __init__(self, mat, K=20):
self.mat = np.array(mat)
self.K = K
self.bi = {}
self.bu = {}
self.qi = {}
self.pu = {}
self.avg = np.mean(self.mat[:, 2]) # 电影平均分
for i in range(self.mat.shape[0]): # mat.shape[0],表示n*m矩阵的n
uid = self.mat[i, 0]
iid = self.mat[i, 1]
self.bi.setdefault(iid, 0) # 向字典中插入
self.bu.setdefault(uid, 0)
self.qi.setdefault(iid, np.random.random((self.K, 1)) / 10 * np.sqrt(self.K)) #随机给每个人,项目赋随机因子
self.pu.setdefault(uid, np.random.random((self.K, 1)) / 10 * np.sqrt(self.K))

def predict(self, uid, iid): # 预测评分的函数
# setdefault的作用是当该用户或者物品未出现过时,新建它的bi,bu,qi,pu,并设置初始值为0
self.bi.setdefault(iid, 0)
self.bu.setdefault(uid, 0)
self.qi.setdefault(iid, np.zeros((self.K, 1)))
self.pu.setdefault(uid, np.zeros((self.K, 1)))
rating = self.avg + self.bi[iid] + self.bu[uid] + np.sum(self.qi[iid] * self.pu[uid]) # 预测评分公式
# 由于评分范围在1到5,所以当分数大于5或小于1时,返回5,1.
if rating > 5:
rating = 5
if rating < 1:
rating = 1
return rating

def train(self, steps=30, gamma=0.04, Lambda=0.15): # 训练函数,step为迭代次数。
print('train data size', self.mat.shape)
for step in range(steps):
print('step', step + 1, 'is running')
KK = np.random.permutation(self.mat.shape[0]) # 随机梯度下降算法,kk为对矩阵进行随机洗牌
rmse = 0.0
mae = 0
for i in range(self.mat.shape[0]):
j = KK[i]
uid = self.mat[j, 0]
iid = self.mat[j, 1]
rating = self.mat[j, 2]
eui = rating - self.predict(uid, iid)
rmse += eui ** 2
mae += abs(eui)
self.bu[uid] += gamma * (eui - Lambda * self.bu[uid])
self.bi[iid] += gamma * (eui - Lambda * self.bi[iid])
tmp = self.qi[iid]
self.qi[iid] += gamma * (eui * self.pu[uid] - Lambda * self.qi[iid])
self.pu[uid] += gamma * (eui * tmp - Lambda * self.pu[uid])
gamma = 0.93 * gamma # gamma以0.93的学习率递减
print('rmse is {0:3f}, ase is {1:3f}'.format(np.sqrt(rmse / self.mat.shape[0]), mae / self.mat.shape[0]))

def test(self, test_data):

test_data = np.array(test_data)
print('test data size', test_data.shape)
rmse = 0.0
mae = 0
for i in range(test_data.shape[0]):
uid = test_data[i, 0]
iid = test_data[i, 1]
rating = test_data[i, 2]
eui = rating - self.predict(uid, iid)
rmse += eui ** 2
mae += abs(eui)
print('rmse is {0:3f}, ase is {1:3f}'.format(np.sqrt(rmse / self.mat.shape[0]), mae / self.mat.shape[0]))


def getData(file_name):
# 获取训练集和测试集的函数
data = []
with open(os.path.expanduser(file_name), encoding='utf-8') as f:
for line in f.readlines():
list = line.split()
data.append([int(i) for i in list[:3]])
random.shuffle(data)
train_data = data[:int(len(data) * 7 / 10)]
test_data = data[int(len(data) * 7 / 10):]
print('load data finished')
print('total data ', len(data))
return train_data, test_data


if __name__ == '__main__':
train_data, test_data = getData('./u.data')
a = SVD(train_data, 30)
a.train()
a.test(test_data)

Author: BY 水蓝
Reprint policy: All articles in this blog are used except for special statements CC BY 4.0 reprint polocy. If reproduced, please indicate source BY 水蓝 !
  TOC