知识卡片
矩阵分解表示潜在关联
矩阵分解用较小的潜在因子表示用户和物品,再通过二者组合估计交互或评分。训练目标需适配任务与观测方式;评分误差只是可用目标之一,不能假定所有推荐分解都最小化同一个指标。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
decomposition of the user-item interaction matrix into the product of two rectangular matrices. This is usually done by minimizing the mathematical cost function RMSE (Root mean square error) which is done using gradient descent. Because of its effectiveness, this method became more popular during the Netflix Prize challenge (as discussed above). Recommendation systems use different matrix factorization techniques. Furthermore, a detailed study on Singular value
参考来源
- 位置:《Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications》第01章《推荐系统的机器学习方法》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications/_epub-src/OEBPS/Text/9789815136746-C1.html)
- 结论依据:摘录中关于矩阵分解表示潜在关联的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:decomposition of the user-item interaction matrix into the product of two rectangular matrices. This is usually done by minimizing the mathematical cost function RMSE (Root mean square error) which is done using gradient descent. Because of its effectiveness, this method became more popular during the Netflix Prize challenge (as discussed above). Recommendation systems use different matrix factorization techniques. Furthermore, a detailed study on Singular value