Negative user preference is an important context that is not sufficiently utilized by many existing recommender systems. This context is especially useful in scenarios where the cost of negative items is high for the users. In this work, we describe a new recommender algorithm that explicitly models negative user preferences in order to recommend more positive items at the top of recommendation-lists. We build upon existing machine-learning model to incorporate the contextual information provided by negative user preference. With experimental evaluations on two openly available datasets, we show that our method is able to improve recommendation quality: by improving accuracy and at the same time reducing the number of negative items at the top of recommendation-lists. Our work demonstrates the value of the contextual information provided by negative feedback, and can also be extended to signed social networks and link prediction in other networks.
[1]
Qiang Yang,et al.
One-Class Collaborative Filtering
,
2008,
2008 Eighth IEEE International Conference on Data Mining.
[2]
Douglas B. Terry,et al.
Using collaborative filtering to weave an information tapestry
,
1992,
CACM.
[3]
A. Tversky,et al.
Prospect theory: an analysis of decision under risk — Source link
,
2007
.
[4]
Abraham Bernstein,et al.
Fewer Flops at the Top: Accuracy, Diversity, and Regularization in Two-Class Collaborative Filtering
,
2017,
RecSys.
[5]
Michael I. Jordan,et al.
Distance Metric Learning with Application to Clustering with Side-Information
,
2002,
NIPS.
[6]
John Riedl,et al.
Item-based collaborative filtering recommendation algorithms
,
2001,
WWW '01.
[7]
Deborah Estrin,et al.
Collaborative Metric Learning
,
2017,
WWW.