Proceedings of the Eleventh ACM Conference on Recommender Systems 2017
DOI: 10.1145/3109859.3109879
|View full text |Cite
|
Sign up to set email alerts
|

Learning to Rank with Trust and Distrust in Recommender Systems

Abstract: The data scarcity of user preferences and the coldstart problem often appear in real-world applications and limit the recommendation accuracy of collaborative filtering strategies. Leveraging the selections of social friends and foes can efficiently face both problems. In this study, we propose a strategy that performs social deep pairwise learning. Firstly, we design a ranking loss function incorporating multiple ranking criteria based on the choice in users, and the choice in their friends and foes to improv… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
3
2

Relationship

1
9

Authors

Journals

citations
Cited by 42 publications
(18 citation statements)
references
References 54 publications
0
18
0
Order By: Relevance
“…Lee et al [24] assumed that the user-item matrix is low rank within certain neighborhoods of the metric space and minimized a pair-wise loss function. Rafailidis and Crestani [32] proposed a model focusing on trust and distrust between users. They pushed the relevant items of users and their friends at the top of the list, while ranking low those of their foes.…”
Section: Collaborative Rankingmentioning
confidence: 99%
“…Lee et al [24] assumed that the user-item matrix is low rank within certain neighborhoods of the metric space and minimized a pair-wise loss function. Rafailidis and Crestani [32] proposed a model focusing on trust and distrust between users. They pushed the relevant items of users and their friends at the top of the list, while ranking low those of their foes.…”
Section: Collaborative Rankingmentioning
confidence: 99%
“…Socially-Aware Recommendation: Leveraging social networks can help us understand user-user relationships and improve the performance of item recommendation [7,8,10,16]. The social network is usually based on friendship or 'trust' relationships.…”
Section: Related Workmentioning
confidence: 99%
“…This listwise approach employs the derivative estimation of NDCG during training of LtR algorithm to assign the parameters of regression trees. Learning to rank model based recommender system [31] utilizes the trust and distrust relationships of the users and presents the most relevant items of the users and their friends at the top of the list. It presents the weighting strategy and captures the correlations between the user preferences based on the trust of the friends and distrust of the foes.…”
Section: Ranking Based Recommender Systemsmentioning
confidence: 99%