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

• URL: http://arxiv.org/abs/2105.07377v1
• Date: Sun, 16 May 2021 08:06:22 GMT
• Title: Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation
• Authors: Lei Chen, Le Wu, Kun Zhang, Richang Hong, Meng Wang
• Abstract summary: In this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation. Our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches.
• Score: 59.183016033308014
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 behaviors. Given any user preference prediction model, researchers either designed ranking based optimization goals or relied on negative item mining techniques for better optimization. Despite the performance gain of these implicit feedback based models, the recommendation results are still far from satisfactory due to the sparsity of the observed item set for each user. To this end, in this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation. The optimization criteria of Set2setRank are two folds: First, we design an item to an item set comparison that encourages each observed item from the sampled observed set is ranked higher than any unobserved item from the sampled unobserved set. Second, we model set level comparison that encourages a margin between the distance summarized from the observed item set and the most "hard" unobserved item from the sampled negative set. Further, an adaptive sampling technique is designed to implement these two goals. We have to note that our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches, and is time efficient in practice. Finally, extensive experiments on three real-world datasets demonstrate the superiority of our proposed approach.

Related papers

• Beyond Positive History: Re-ranking with List-level Hybrid Feedback [49.52149227298746]
  We propose Re-ranking with List-level Hybrid Feedback (dubbed RELIFE) It captures user's preferences and behavior patterns with three modules. Experiments show that RELIFE significantly outperforms SOTA re-ranking baselines.
  arXiv  Detail & Related papers  (2024-10-28T06:39:01Z)
• AutoSAM: Towards Automatic Sampling of User Behaviors for Sequential Recommender Systems [48.461157194277504]
  We propose a general automatic sampling framework, named AutoSAM, to non-uniformly treat historical behaviors. Specifically, AutoSAM augments the standard sequential recommendation architecture with an additional sampler layer to adaptively learn the skew distribution of the raw input. We theoretically design multi-objective sampling rewards including Future Prediction and Sequence Perplexity, and then optimize the whole framework in an end-to-end manner.
  arXiv  Detail & Related papers  (2023-11-01T09:25:21Z)
• Preference or Intent? Double Disentangled Collaborative Filtering [34.63377358888368]
  In traditional collaborative filtering approaches, both intent and preference factors are usually entangled in the modeling process. We propose a two-fold representation learning approach, namely Double Disentangled Collaborative Filtering (DDCF), for personalized recommendations.
  arXiv  Detail & Related papers  (2023-05-18T16:13:41Z)
• Pacos: Modeling Users' Interpretable and Context-Dependent Choices in Preference Reversals [8.041047797530808]
  We identify three factors contributing to context effects: users' adaptive weights, the inter-item comparison, and display positions. We propose a context-dependent preference model named Pacos as a unified framework for addressing three factors simultaneously. Experimental results show that the proposed method has better performance than prior works in predicting users' choices.
  arXiv  Detail & Related papers  (2023-03-10T01:49:56Z)
• Recommendation Systems with Distribution-Free Reliability Guarantees [83.80644194980042]
  We show how to return a set of items rigorously guaranteed to contain mostly good items. Our procedure endows any ranking model with rigorous finite-sample control of the false discovery rate. We evaluate our methods on the Yahoo! Learning to Rank and MSMarco datasets.
  arXiv  Detail & Related papers  (2022-07-04T17:49:25Z)
• Two-level monotonic multistage recommender systems [5.983189537988243]
  Two-level monotonic property characterizing a monotonic chain of events for personalized prediction. Regularized cost function to learn user-specific behaviors at different stages. Algorithm based on blockwise coordinate descent.
  arXiv  Detail & Related papers  (2021-10-06T08:50:32Z)
• A Case Study on Sampling Strategies for Evaluating Neural Sequential Item Recommendation Models [69.32128532935403]
  Two well-known strategies to sample negative items are uniform random sampling and sampling by popularity. We re-evaluate current state-of-the-art sequential recommender models from the point of view. We find that both sampling strategies can produce inconsistent rankings compared with the full ranking of the models.
  arXiv  Detail & Related papers  (2021-07-27T19:06:03Z)
• SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit Feedback [50.13745601531148]
  We propose a novel setwise Bayesian approach for collaborative ranking, namely SetRank, to accommodate the characteristics of implicit feedback in recommender system. Specifically, SetRank aims at maximizing the posterior probability of novel setwise preference comparisons. We also present the theoretical analysis of SetRank to show that the bound of excess risk can be proportional to $sqrtM/N$.
  arXiv  Detail & Related papers  (2020-02-23T06:40:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.