Dimitrios Rafailidis
Fabio Crestani
ABSTRACT
Recommendation systems have gained a lot of attention because of their importance for handling the unprecedentedly large amount of available content on the Web, such as movies, music, books, etc. Although Collaborative Ranking (CR) models can produce accurate recommendation lists, in practice several real-world problems decrease their ranking performance, such as the sparsity and cold start problems. Here, to account for the fact that the selections of social friends can leverage the recommendation accuracy, we propose SCR, a Social CR model. Our model learns personalized ranking functions collaboratively, using the notion of Social Reverse Height, that is, considering how well the relevant items of users and their social friends have been ranked at the top of the list. The reason that we focus on the top of the list is that users mainly see the top-N recommendations, and not the whole ranked list. In our experiments with a benchmark data set from Epinions, we show that our SCR model performs better than state-of-the-art CR models that either consider social relationships or focus on the ranking performance at the top of the list.
- A. J. Chaney, D. M. Blei, and T. Eliassi-Rad. A probabilistic model for using social networks in personalized item recommendation. In RecSys, pages 43--50, 2015. Google Scholar
Digital Library
- K. Christakopoulou and A. Banerjee. Collaborative ranking with a push at the top. In WWW, pages 205--215, 2015. Google ScholarDigital Library
- R. Forsati, M. Mahdavi, M. Shamsfard, and M. Sarwat. Matrix factorization with explicit trust and distrust side information for improved social recommendation. TOIS, 32(4):17:1--17:38, 2014. Google ScholarDigital Library
- P. Jain, P. Netrapalli, and S. Sanghavi. Low-rank matrix completion using alternating minimization. In STOC, pages 665--674, 2013. Google ScholarDigital Library
- Y. Koren, R. M. Bell, and C. Volinsky. Matrix factorization techniques for recommender systems. IEEE Computer, 42(8):30--37, 2009. Google ScholarDigital Library
- A. Krohn-Grimberghe, L. Drumond, C. Freudenthaler, and L. Schmidt-Thieme. Multi-relational matrix factorization using bayesian personalized ranking for social network data. In WSDM, pages 173--182, 2012. Google ScholarDigital Library
- T.-Y. Liu. Learning to rank for information retrieval. Found. Trends Inf. Retr., 3(3):225--331. Google ScholarDigital Library
- H. Ma, H. Yang, M. R. Lyu, and I. King. Sorec: social recommendation using probabilistic matrix factorization. In CIKM, pages 931--940, 2008. Google ScholarDigital Library
- S. Rendle, C. Freudenthaler, Z. Gantner, and L. Schmidt-Thieme. Bpr: Bayesian personalized ranking from implicit feedback. In UAI, pages 452--461, 2009. Google ScholarDigital Library
- Y. Shi, A. Karatzoglou, L. Baltrunas, M. Larson, N. Oliver, and A. Hanjalic. Climf: Learning to maximize reciprocal rank with collaborative less-is-more filtering. In RecSys, pages 139--146, 2012. Google ScholarDigital Library
- Y. Shi, X. Zhao, J. Wang, M. Larson, and A. Hanjalic. Adaptive diversification of recommendation results via latent factor portfolio. In SIGIR, pages 175--184, 2012. Google ScholarDigital Library
- M. Weimer, A. Karatzoglou, Q. V. Le, and A. J. Smola. COFI RANK - maximum margin matrix factorization for collaborative ranking. In NIPS, pages 1593--1600, 2007.Google ScholarDigital Library
- X. Yang, H. Steck, Y. Guo, and Y. Liu. On top-k recommendation using social networks. In RecSys, pages 67--74, 2012. Google ScholarDigital Library
- T. Zhao, J. McAuley, and I. King. Leveraging social connections to improve personalized ranking for collaborative filtering. In CIKM, pages 261--270, 2014. Google ScholarDigital Library
Index Terms
- Collaborative Ranking with Social Relationships for Top-N Recommendations
Recommendations
Joint Collaborative Ranking with Social Relationships in Top-N Recommendation
CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge ManagementWith the advent of learning to rank methods, relevant studies showed that Collaborative Ranking (CR) models can produce accurate ranked lists in the top-N recommendation problem. However, in practice several real-world problems decrease their ranking ...
A Collaborative Ranking Model for Cross-Domain Recommendations
CIKM '17: Proceedings of the 2017 ACM on Conference on Information and Knowledge ManagementWith the advent of social media, generating high quality cross-domain recommendations has become more and more important for users of heterogeneous domains. In this study, we propose a collaborative ranking model to generate cross-domain ...
Graph-based collaborative ranking
GRank is a novel framework, designed for recommendation based on rank data.GRank handles the sparsity problem of neighbor-based collaborative ranking.GRank uses the novel TPG graph structure to model users' choice context.GRank directly ranks itemsfor a ...
Comments