arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.09841cs.IRcs.LGstat.ML

SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback

University of Science and Technology of China(中国科学技术大学);Baidu Talent Intelligence Center, Baidu Inc.(百度人才智能中心(百度公司));Business Intelligence Lab, Baidu Research(百度研究院商业智能实验室)

Chao Wang, Hengshu Zhu, Chen Zhu, Chuan Qin, Hui Xiong

英文摘要:

The recent development of online recommender systems has a focus on collaborative ranking from implicit feedback, such as user clicks and purchases. Different from explicit ratings, which reflect graded user preferences, the implicit feedback only generates positive and unobserved labels. While considerable efforts have been made in this direction, the well-known pairwise and listwise approaches have still been limited by various challenges. Specifically, for the pairwise approaches, the assumption of independent pairwise preference is not always held in practice. Also, the listwise approaches cannot efficiently accommodate "ties" due to the precondition of the entire list permutation. To this end, in this paper, we propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to inherently accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons and can be implemented with matrix factorization and neural networks. Meanwhile, we also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $\sqrt{M/N}$, where $M$ and $N$ are the numbers of items and users, respectively. Finally, extensive experiments on four real-world datasets clearly validate the superiority of SetRank compared with various state-of-the-art baselines.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑