python
/
easy-algorithm-interview-and-practice
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add matrix

pull/1/head
wanglei 2020-07-11 22:28:44 +08:00
parent 1a86f695ac
commit 2c08cbe241
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
papers/recommend/推荐系统中的矩阵分解详解.md
View File

@ -59,7 +59,7 @@ Simon Funk提出的方案被称为FunkSVD。FunkSVD不将矩阵分解为三个
优化的目标函数为
$$\min \limits_{q^*,p^*} \sum \limits_{(u, i)} (r_{ui} - q_i^Tp_u) ^ 2$$
$$f_3(d) = max \limits_{x_3}(2x_3 + f_4(d-x_3))$$
$$f_3(d) = \max \limits_{x_3}(2x_3 + f_4(d-x_3))$$
核心思想事通过最小化观测数据的MSE，讲user与item的用一个低秩的隐向量表示出来。同时，还可以加上L2正则
$$\min limits_{q^*,p^*} \sum \limits_{(u, i)} (r_{ui} - q_i^T p_u) ^ 2 + \lambda (||q_i||^2 + ||p_u||^2)$$