.png){kind=icon}
返回
Improving maximum margin matrix factorization
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-008-5073-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Collaborative filtering is a popular method for personalizing product recommendations. Maximum Margin Matrix Factorization (MMMF) has been proposed as one successful learning approach to this task and has been recently extended to structured ranking losses. In this paper we discuss a number of extensions to MMMF by introducing offset terms, item dependent regularization and a graph kernel on the recommender graph. We show equivalence between graph kernels and the recent MMMF extensions by Mnih and Salakhutdinov (Advances in Neural Information Processing Systems 20, 2008). Experimental evaluation of the introduced extensions show improved performance over the original MMMF formulation.
Keyword:
collaborative filtering
structured estimation
recommender systems
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
查看更多机构
引用论文
.png){kind=icon}
Technology Driven Rural Healthcare Practices for the Villagers of Sarai Nooruddinpur, Uttar Pradesh
PREAI
分享收藏分享收藏
没有更多内容