2019
DOI: 10.1016/j.future.2018.12.052
|View full text |Cite
|
Sign up to set email alerts
|

SDBPR: Social distance-aware Bayesian personalized ranking for recommendation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 16 publications
0
6
0
Order By: Relevance
“…For example, based on the social network among users, document [3] used the context aware Point-of-Interest (POI) recommendation model based on matrix decomposition and used the social network data of users and the POI category information to establish a general matrix decomposition model to improve the accuracy of recommendation results. Documents [4], [5] used the random walk method to travel a social network. According to the distance between users in the travel process, it predicted the similarity between users and filled in the missing values in a matrix, which fixed the data sparsity.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, based on the social network among users, document [3] used the context aware Point-of-Interest (POI) recommendation model based on matrix decomposition and used the social network data of users and the POI category information to establish a general matrix decomposition model to improve the accuracy of recommendation results. Documents [4], [5] used the random walk method to travel a social network. According to the distance between users in the travel process, it predicted the similarity between users and filled in the missing values in a matrix, which fixed the data sparsity.…”
Section: Related Workmentioning
confidence: 99%
“…The two user transmission paths are not limited to being one way. Therefore, the overall indirect trust of a user is calculated as shown in formula (5).…”
Section: B Sparse Data Filling Based On Trust Cloud Similaritymentioning
confidence: 99%
“…Bayesian Personalized Ranking(BPR) is such a sorting algorithm is suitable for our case. BPR is an optimization framework that uses stochastic gradient descent to achieve pairwise sorting [41]. BPR algorithm belongs to pairwise approach, and is optimized for each user's product preferences.…”
Section: Personalized Ranking Of Poismentioning
confidence: 99%
“…To overcome content-based methods limitations, CF-based approaches lay on profiles of a group of users who share the same or similar tastes. CF-based methods are built on the assumption that within a group of users with preferences identical or similar to those of a target user, the historical data of some of them can be used to predict the future interests of the target user [5]. CF-based approaches are very popular and organized into memory-based CF and model-based CF [6].…”
Section: Introductionmentioning
confidence: 99%