SDBPR: Social distance-aware Bayesian personalized ranking for recommendation
SDBPR: Social distance-aware Bayesian personalized ranking for recommendation
复制标题
DOI：
10.1016/j.future.2018.12.052
复制
发表时间：
2019-06
期刊：
影响因子：
--
通讯作者：
Feng Zhao;Yu Shen;Xiangyu Gui;Hai Jin
中科院分区：
文献类型：
--
作者：
Feng Zhao;Yu Shen;Xiangyu Gui;Hai Jin
Recommendation systems recommend new items to users. Because training data contain only binary forms of implicit feedback in many cases, such as in IoT and IoV, one-class collaborative filtering, which can be solved by using rating-based methods to estimate the numeric scores of items or ranking-based methods based on the preferences of each user for items, must be addressed. In addition, because of the sparsity of such data, ranking-based methods are often preferred over rating-based methods when only implicit feedback is available. Social information has recently been used to improve the accuracy of rankings. Traditional approaches simply consider the direct friends of users in a social network, but this process fails to consider the propagation of influence along connections in the social network and cannot reveal the complex graph structure of the social network. In this paper, a novel social distance-aware Bayesian personalized ranking model, called SDBPR, is proposed to generate more accurate recommendations. SDBPR uses a random walk to travel the social network and then makes pairwise assumptions about the ranking order based on the distance between users along the random walk. The experimental results on two real datasets show that the proposed approaches significantly outperform the baseline approaches in terms of ranking prediction.
