Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation

  title={Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation},
  author={Lei Chen and Le Wu and Kun Zhang and Richang Hong and Meng Wang},
  journal={Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval},
  • Lei Chen, Le Wu, +2 authors Meng Wang
  • Published 2021
  • Computer Science
  • Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval
As users often express their preferences with binary behavior data~(implicit feedback), such as clicking items or buying products, implicit feedback based Collaborative Filtering~(CF) models predict the top ranked items a user might like by leveraging implicit user-item interaction data. For each user, the implicit feedback is divided into two sets: an observed item set with limited observed behaviors, and a large unobserved item set that is mixed with negative item behaviors and unknown… Expand

Figures and Tables from this paper

Graph-based Exercise- and Knowledge-Aware Learning Network for Student Performance Prediction
A Graph-based Exercise and Knowledge-Aware Learning Network is proposed for accurate student score prediction by learning students’ mastery of exercises and knowledge concepts respectively and applying graph convolution techniques in the prediction process. Expand


CoFiSet: Collaborative Filtering via Learning Pairwise Preferences over Item-sets
A new and relaxed assumption of pairwise preferences over item-sets is proposed, which defines a user’s preference on a set of items (item-set) instead of on a single item, and a general algorithm called CoFiSet is developed, which performs better than several state of theart methods on various ranking-oriented evaluation metrics on two real-world data sets. Expand
SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback
This paper proposes a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to inherently accommodate the characteristics of implicit feedback in recommender system and aims at maximizing the posterior probability of novel set Wise preference comparisons. Expand
Optimizing top-n collaborative filtering via dynamic negative item sampling
This paper proposes to dynamically choose negative training samples from the ranked list produced by the current prediction model and iteratively update the model, showing that this approach not only reduces the training time, but also leads to significant performance gains. Expand
BPR: Bayesian Personalized Ranking from Implicit Feedback
This paper presents a generic optimization criterion BPR-Opt for personalized ranking that is the maximum posterior estimator derived from a Bayesian analysis of the problem and provides a generic learning algorithm for optimizing models with respect to B PR-Opt. Expand
A Boosting Algorithm for Item Recommendation with Implicit Feedback
A boosting algorithm named AdaBPR (Adaptive Boosting Personalized Ranking) is proposed for top-N item recommendation using users' implicit feedback and demonstrates its effectiveness on three datasets compared with strong baseline algorithms. Expand
Improving pairwise learning for item recommendation from implicit feedback
The experiments indicate that the proposed adaptive sampler improves the state-of-the art learning algorithm largely in convergence without negative effects on prediction quality or iteration runtime. Expand
Multiple Pairwise Ranking with Implicit Feedback
This paper proposes a Multiple Pairwise Ranking (MPR) approach, which relaxes the simple pairwise preference assumption in previous works by further tapping the connections among items with multiple pairwise ranking criteria and exploits the preference difference among multiple pairs of items. Expand
Adaptive Pairwise Preference Learning for Collaborative Recommendation with Implicit Feedbacks
This paper proposes a novel adaptive pairwise preference learning algorithm, which addresses the above two limitations in a single algorithm with a concise and general learning scheme. Expand
GBPR: Group Preference Based Bayesian Personalized Ranking for One-Class Collaborative Filtering
A new and improved assumption, group Bayesian personalized ranking (GBPR), is proposed, via introducing richer interactions among users, and a novel algorithm is designed correspondingly, which can recommend items more accurately as shown by various ranking-oriented evaluation metrics on four real-world datasets in the authors' experiments. Expand
Collaborative List-and-Pairwise Filtering from Implicit Feedback
The implicit feedback based collaborative filtering (CF) has attracted much attention in recent years, mainly because users implicitly express their preferences in many real-world scenarios. TheExpand