Recommending Burgers based on Pizza Preferences: Addressing Data Sparsity with a Product of Experts

• URL: http://arxiv.org/abs/2104.12822v1
• Date: Mon, 26 Apr 2021 18:56:04 GMT
• Title: Recommending Burgers based on Pizza Preferences: Addressing Data Sparsity with a Product of Experts
• Authors: Martin Milenkoski, Diego Antognini, Claudiu Musat
• Abstract summary: We describe a method to tackle data sparsity and create recommendations in domains with limited knowledge about the user preferences. The intuition is that user-item interactions in a source domain can augment the recommendation quality in a target domain. We present results on two widely-used datasets - Amazon and Yelp, which support the claim that holistic user preference knowledge leads to better recommendations.
• Score: 4.945620732698048
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper we describe a method to tackle data sparsity and create recommendations in domains with limited knowledge about the user preferences. We expand the variational autoencoder collaborative filtering from a single-domain to a multi domain setting. The intuition is that user-item interactions in a source domain can augment the recommendation quality in a target domain. The intuition can be taken to its extreme, where, in a cross-domain setup, the user history in a source domain is enough to generate high quality recommendations in a target one. We thus create a Product-of-Experts (POE) architecture for recommendations that jointly models user-item interactions across multiple domains. The method is resilient to missing data for one or more of the domains, which is a situation often found in real life. We present results on two widely-used datasets - Amazon and Yelp, which support the claim that holistic user preference knowledge leads to better recommendations. Surprisingly, we find that in select cases, a POE recommender that does not access the target domain user representation can surpass a strong VAE recommender baseline trained on the target domain. We complete the analysis with a study of the reasons behind this outperformance and an in-depth look at the resulting embedding spaces.

Related papers

• Enhancing CTR Prediction in Recommendation Domain with Search Query Representation [31.86615693808628]
  We propose a framework that learns from user search query embeddings within the context of user preferences in the recommendation domain. Specifically, user search query sequences from the search domain are used to predict the items users will click at the next time point in the recommendation domain.
  arXiv  Detail & Related papers  (2024-10-28T19:52:09Z)
• Coherence-guided Preference Disentanglement for Cross-domain Recommendations [71.4198675855171]
  We propose a Coherence-guided Preference Disentanglement (CoPD) method aimed at improving cross-domain recommendation by i) explicitly extracting shared item attributes to guide the learning of shared user preferences and ii) disentangling these preferences to identify specific user interests transferred between domains. Experiments conducted on real-world datasets demonstrate the superior performance of our proposed CoPD over existing competitive baselines, highlighting its effectiveness in enhancing cross-domain recommendation performance.
  arXiv  Detail & Related papers  (2024-10-27T20:21:14Z)
• Mixed Attention Network for Cross-domain Sequential Recommendation [63.983590953727386]
  We propose a Mixed Attention Network (MAN) with local and global attention modules to extract the domain-specific and cross-domain information. Experimental results on two real-world datasets demonstrate the superiority of our proposed model.
  arXiv  Detail & Related papers  (2023-11-14T16:07:16Z)
• Cross-domain recommendation via user interest alignment [20.387327479445773]
  Cross-domain recommendation aims to leverage knowledge from multiple domains to alleviate the data sparsity and cold-start problems in traditional recommender systems. The general practice of this approach is to train user embeddings in each domain separately and then aggregate them in a plain manner. We propose a novel cross-domain recommendation framework, namely COAST, to improve recommendation performance on dual domains.
  arXiv  Detail & Related papers  (2023-01-26T23:54:41Z)
• Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations [92.47380209981348]
  We propose a Diverse Preference Augmentation framework with multiple source domains based on meta-learning. We generate diverse ratings in a new domain of interest to handle overfitting on the case of sparse interactions. These ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability.
  arXiv  Detail & Related papers  (2022-04-01T10:10:50Z)
• A cross-domain recommender system using deep coupled autoencoders [77.86290991564829]
  Two novel coupled autoencoder-based deep learning methods are proposed for cross-domain recommendation. The first method aims to simultaneously learn a pair of autoencoders in order to reveal the intrinsic representations of the items in the source and target domains. The second method is derived based on a new joint regularized optimization problem, which employs two autoencoders to generate in a deep and non-linear manner the user and item-latent factors.
  arXiv  Detail & Related papers  (2021-12-08T15:14:26Z)
• RecGURU: Adversarial Learning of Generalized User Representations for Cross-Domain Recommendation [19.61356871656398]
  Cross-domain recommendation can help alleviate the data sparsity issue in traditional sequential recommender systems. We propose the RecGURU algorithm framework to generate a Generalized User Representation (GUR) incorporating user information across domains in sequential recommendation.
  arXiv  Detail & Related papers  (2021-11-19T08:41:06Z)
• Review-Based Domain Disentanglement without Duplicate Users or Contexts for Cross-Domain Recommendation [1.2074552857379273]
  Cross-domain recommendation has shown promising results in solving data-sparsity and cold-start problems. Our model (named SER) uses three text analysis modules, guided by a single domain discriminator for disentangled representation learning.
  arXiv  Detail & Related papers  (2021-10-25T05:17:58Z)
• Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations [85.6250759280292]
  Cross domain recommender systems have been increasingly valuable for helping consumers identify useful items in different applications. Existing cross-domain models typically require large number of overlap users, which can be difficult to obtain in some applications. We propose a novel cross-domain recommendation model based on dual learning that transfers information between two related domains in an iterative manner.
  arXiv  Detail & Related papers  (2021-04-17T09:18:59Z)
• CATN: Cross-Domain Recommendation for Cold-Start Users via Aspect Transfer Network [49.35977893592626]
  We propose a cross-domain recommendation framework via aspect transfer network for cold-start users (named CATN) CATN is devised to extract multiple aspects for each user and each item from their review documents, and learn aspect correlations across domains with an attention mechanism. On real-world datasets, the proposed CATN outperforms SOTA models significantly in terms of rating prediction accuracy.
  arXiv  Detail & Related papers  (2020-05-21T10:05:19Z)

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.