Topic-Level Bayesian Surprise and Serendipity for Recommender Systems

• URL: http://arxiv.org/abs/2308.06368v2
• Date: Wed, 18 Oct 2023 21:21:50 GMT
• Title: Topic-Level Bayesian Surprise and Serendipity for Recommender Systems
• Authors: Tonmoy Hasan and Razvan Bunescu
• Abstract summary: A recommender system that optimize its recommendations solely to fit a user's history of ratings for consumed items can create a filter bubble. One approach to mitigate this undesired behavior is to recommend items with high potential for serendipity. We propose a content-based formulation of serendipity that is rooted in Bayesian surprise and use it to measure the serendipity of items after they are consumed and rated by the user.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: A recommender system that optimizes its recommendations solely to fit a user's history of ratings for consumed items can create a filter bubble, wherein the user does not get to experience items from novel, unseen categories. One approach to mitigate this undesired behavior is to recommend items with high potential for serendipity, namely surprising items that are likely to be highly rated. In this paper, we propose a content-based formulation of serendipity that is rooted in Bayesian surprise and use it to measure the serendipity of items after they are consumed and rated by the user. When coupled with a collaborative-filtering component that identifies similar users, this enables recommending items with high potential for serendipity. To facilitate the evaluation of topic-level models for surprise and serendipity, we introduce a dataset of book reading histories extracted from Goodreads, containing over 26 thousand users and close to 1.3 million books, where we manually annotate 449 books read by 4 users in terms of their time-dependent, topic-level surprise. Experimental evaluations show that models that use Bayesian surprise correlate much better with the manual annotations of topic-level surprise than distance-based heuristics, and also obtain better serendipitous item recommendation performance.

Related papers

• Engineering Serendipity through Recommendations of Items with Atypical Aspects [0.5892638927736115]
  We introduce the new task of engineering serendipity through recommendations of items with atypical aspects.<n>We describe an LLM-based system pipeline that extracts atypical aspects from item reviews, then estimates and aggregates their user-specific utility.<n>We show that serendipity-based rankings generated by the system are highly correlated with ground truth rankings.
  arXiv  Detail & Related papers  (2025-05-29T15:53:21Z)
• Cold-start Recommendation by Personalized Embedding Region Elicitation [14.78070264373809]
  Existing elicitation methods employ a fixed set of items to learn the user's preference. This paper addresses this challenge using a 2-phase, personalized elicitation scheme. We show that each subproblem in the elicitation scheme can be efficiently implemented.
  arXiv  Detail & Related papers  (2024-06-03T04:03:24Z)
• How to Surprisingly Consider Recommendations? A Knowledge-Graph-based Approach Relying on Complex Network Metrics [0.2537383030441368]
  We propose a Knowledge Graph based recommender system by encoding user interactions on item catalogs. Our study explores whether network-level metrics on KGs can influence the degree of surprise in recommendations. We experimentally evaluate our approach on two datasets of LastFM listening histories and synthetic Netflix viewing profiles.
  arXiv  Detail & Related papers  (2024-05-14T09:38:44Z)
• Text Matching Improves Sequential Recommendation by Reducing Popularity Biases [48.272381505993366]
  TASTE verbalizes items and user-item interactions using identifiers and attributes of items. Our experiments show that TASTE outperforms the state-of-the-art methods on widely used sequential recommendation datasets.
  arXiv  Detail & Related papers  (2023-08-27T07:44:33Z)
• Improving Recommendation System Serendipity Through Lexicase Selection [53.57498970940369]
  We propose a new serendipity metric to measure the presence of echo chambers and homophily in recommendation systems. We then attempt to improve the diversity-preservation qualities of well known recommendation techniques by adopting a parent selection algorithm known as lexicase selection. Our results show that lexicase selection, or a mixture of lexicase selection and ranking, outperforms its purely ranked counterparts in terms of personalization, coverage and our specifically designed serendipity benchmark.
  arXiv  Detail & Related papers  (2023-05-18T15:37:38Z)
• Batch versus Sequential Active Learning for Recommender Systems [3.7796614675664397]
  We show that sequential mode produces the most accurate recommendations for dense data sets. For most active learners, the best predictor turned out to be FunkSVD in combination with sequential mode.
  arXiv  Detail & Related papers  (2022-01-19T12:50:36Z)
• Correcting the User Feedback-Loop Bias for Recommendation Systems [34.44834423714441]
  We propose a systematic and dynamic way to correct user feedback-loop bias in recommendation systems. Our method includes a deep-learning component to learn each user's dynamic rating history embedding. We empirically validated the existence of such user feedback-loop bias in real world recommendation systems.
  arXiv  Detail & Related papers  (2021-09-13T15:02:55Z)
• PURS: Personalized Unexpected Recommender System for Improving User Satisfaction [76.98616102965023]
  We describe a novel Personalized Unexpected Recommender System (PURS) model that incorporates unexpectedness into the recommendation process. Extensive offline experiments on three real-world datasets illustrate that the proposed PURS model significantly outperforms the state-of-the-art baseline approaches.
  arXiv  Detail & Related papers  (2021-06-05T01:33:21Z)
• Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation [59.183016033308014]
  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.
  arXiv  Detail & Related papers  (2021-05-16T08:06:22Z)
• Regret in Online Recommendation Systems [73.58127515175127]
  This paper proposes a theoretical analysis of recommendation systems in an online setting, where items are sequentially recommended to users over time. In each round, a user, randomly picked from a population of $m$ users, requests a recommendation. The decision-maker observes the user and selects an item from a catalogue of $n$ items. The performance of the recommendation algorithm is captured through its regret, considering as a reference an Oracle algorithm aware of these probabilities.
  arXiv  Detail & Related papers  (2020-10-23T12:48:35Z)
• Controllable Multi-Interest Framework for Recommendation [64.30030600415654]
  We formalize the recommender system as a sequential recommendation problem. We propose a novel controllable multi-interest framework for the sequential recommendation, called ComiRec. Our framework has been successfully deployed on the offline Alibaba distributed cloud platform.
  arXiv  Detail & Related papers  (2020-05-19T10:18:43Z)

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.