Context-aware adaptive personalised recommendation: a meta-hybrid

• URL: http://arxiv.org/abs/2410.13374v1
• Date: Thu, 17 Oct 2024 09:24:40 GMT
• Title: Context-aware adaptive personalised recommendation: a meta-hybrid
• Authors: Peter Tibensky, Michal Kompan,
• Abstract summary: We propose a meta-hybrid recommender that uses machine learning to predict an optimal algorithm. Based on the proposed model, it is possible to predict which recommender will provide the most precise recommendations to a user.
• Score: 0.41436032949434404
• License:
• Abstract: Recommenders take place on a wide scale of e-commerce systems, reducing the problem of information overload. The most common approach is to choose a recommender used by the system to make predictions. However, users vary from each other; thus, a one-fits-all approach seems to be sub-optimal. In this paper, we propose a meta-hybrid recommender that uses machine learning to predict an optimal algorithm. In this way, the best-performing recommender is used for each specific session and user. This selection depends on contextual and preferential information collected about the user. We use standard MovieLens and The Movie DB datasets for offline evaluation. We show that based on the proposed model, it is possible to predict which recommender will provide the most precise recommendations to a user. The theoretical performance of our meta-hybrid outperforms separate approaches by 20-50% in normalized Discounted Gain and Root Mean Square Error metrics. However, it is hard to obtain the optimal performance based on widely-used standard information stored about users.

Related papers

• Preference Diffusion for Recommendation [50.8692409346126]
  We propose PreferDiff, a tailored optimization objective for DM-based recommenders. PreferDiff transforms BPR into a log-likelihood ranking objective to better capture user preferences. It is the first personalized ranking loss designed specifically for DM-based recommenders.
  arXiv  Detail & Related papers  (2024-10-17T01:02:04Z)
• Improving Recommendation Fairness via Data Augmentation [66.4071365614835]
  Collaborative filtering based recommendation learns users' preferences from all users' historical behavior data, and has been popular to facilitate decision making. A recommender system is considered unfair when it does not perform equally well for different user groups according to users' sensitive attributes. In this paper, we study how to improve recommendation fairness from the data augmentation perspective.
  arXiv  Detail & Related papers  (2023-02-13T13:11:46Z)
• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• Understanding or Manipulation: Rethinking Online Performance Gains of Modern Recommender Systems [38.75457258877731]
  We present a framework for benchmarking the degree of manipulations of recommendation algorithms. We find that a high online click-through rate does not necessarily mean a better understanding of user initial preference. We advocate that future recommendation algorithm studies should be treated as an optimization problem with constrained user preference manipulations.
  arXiv  Detail & Related papers  (2022-10-11T17:56:55Z)
• 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)
• Introducing a Framework and a Decision Protocol to Calibrate Recommender Systems [0.0]
  This paper proposes an approach to create recommendation lists with a calibrated balance of genres. The main claim is that calibration can contribute positively to generate fairer recommendations. We propose a conceptual framework and a decision protocol to generate more than one thousand combinations of calibrated systems.
  arXiv  Detail & Related papers  (2022-04-07T19:30:55Z)
• Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation [133.8758914874593]
  Capturing the dynamics in user preference is crucial to better predict user future behaviors because user preferences often drift over time. Many existing recommendation algorithms -- including both shallow and deep ones -- often model such dynamics independently. This paper considers the problem of embedding a user's sequential behavior into the latent space of user preferences.
  arXiv  Detail & Related papers  (2022-04-02T03:23:46Z)
• MAMO: Memory-Augmented Meta-Optimization for Cold-start Recommendation [46.0605442943949]
  A common challenge for most recommender systems is the cold-start problem. In this paper, we design two memory matrices that can store task-specific memories and feature-specific memories. We adopt a meta-optimization approach for optimizing the proposed method.
  arXiv  Detail & Related papers  (2020-07-07T03:25:15Z)
• Using Stable Matching to Optimize the Balance between Accuracy and Diversity in Recommendation [3.0938904602244355]
  Increasing aggregate diversity (or catalog coverage) is an important system-level objective in many recommendation domains. Attempts to increase aggregate diversity often result in lower recommendation accuracy for end users. We propose a two-sided post-processing approach in which both user and item utilities are considered.
  arXiv  Detail & Related papers  (2020-06-05T22:12:25Z)
• MetaSelector: Meta-Learning for Recommendation with User-Level Adaptive Model Selection [110.87712780017819]
  We propose a meta-learning framework to facilitate user-level adaptive model selection in recommender systems. We conduct experiments on two public datasets and a real-world production dataset.
  arXiv  Detail & Related papers  (2020-01-22T16:05:01Z)

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.