Towards High-Order Complementary Recommendation via Logical Reasoning Network

• URL: http://arxiv.org/abs/2212.04966v1
• Date: Fri, 9 Dec 2022 16:27:03 GMT
• Title: Towards High-Order Complementary Recommendation via Logical Reasoning Network
• Authors: Longfeng Wu, Yao Zhou, Dawei Zhou
• Abstract summary: We propose a logical reasoning network, LOGIREC, to learn embeddings of products. LOGIREC is capable of capturing the asymmetric complementary relationship between products. We also propose a hybrid network that is jointly optimized for learning a more generic product representation.
• Score: 19.232457960085625
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Complementary recommendation gains increasing attention in e-commerce since it expedites the process of finding frequently-bought-with products for users in their shopping journey. Therefore, learning the product representation that can reflect this complementary relationship plays a central role in modern recommender systems. In this work, we propose a logical reasoning network, LOGIREC, to effectively learn embeddings of products as well as various transformations (projection, intersection, negation) between them. LOGIREC is capable of capturing the asymmetric complementary relationship between products and seamlessly extending to high-order recommendations where more comprehensive and meaningful complementary relationship is learned for a query set of products. Finally, we further propose a hybrid network that is jointly optimized for learning a more generic product representation. We demonstrate the effectiveness of our LOGIREC on multiple public real-world datasets in terms of various ranking-based metrics under both low-order and high-order recommendation scenarios.

Related papers

• Topology-Aware Popularity Debiasing via Simplicial Complexes [19.378410889819165]
  Test-time Simplicial Propagation (TSP) incorporates simplicial complexes (SCs) to enhance the expressiveness of Graph Neural Networks (GNNs) Our approach captures multi-order relationships through SCs, providing a more comprehensive representation of user-item interactions. Our method produces more uniform distributions of item representations, leading to fairer and more accurate recommendations.
  arXiv  Detail & Related papers  (2024-11-21T07:12:47Z)
• Large Language Model Empowered Embedding Generator for Sequential Recommendation [57.49045064294086]
  Large Language Model (LLM) has the potential to understand the semantic connections between items, regardless of their popularity. We present LLMEmb, an innovative technique that harnesses LLM to create item embeddings that bolster the performance of Sequential Recommender Systems.
  arXiv  Detail & Related papers  (2024-09-30T03:59:06Z)
• End-to-End Learnable Item Tokenization for Generative Recommendation [51.82768744368208]
  We propose ETEGRec, a novel End-To-End Generative Recommender by seamlessly integrating item tokenization and generative recommendation. Our framework is developed based on the dual encoder-decoder architecture, which consists of an item tokenizer and a generative recommender.
  arXiv  Detail & Related papers  (2024-09-09T12:11:53Z)
• Efficient and Deployable Knowledge Infusion for Open-World Recommendations via Large Language Models [53.547190001324665]
  We propose REKI to acquire two types of external knowledge about users and items from large language models (LLMs) We develop individual knowledge extraction and collective knowledge extraction tailored for different scales of scenarios, effectively reducing offline resource consumption. Experiments demonstrate that REKI outperforms state-of-the-art baselines and is compatible with lots of recommendation algorithms and tasks.
  arXiv  Detail & Related papers  (2024-08-20T03:45:24Z)
• DaRec: A Disentangled Alignment Framework for Large Language Model and Recommender System [83.34921966305804]
  Large language models (LLMs) have demonstrated remarkable performance in recommender systems. We propose a novel plug-and-play alignment framework for LLMs and collaborative models. Our method is superior to existing state-of-the-art algorithms.
  arXiv  Detail & Related papers  (2024-08-15T15:56:23Z)
• Two Is Better Than One: Dual Embeddings for Complementary Product Recommendations [2.294014185517203]
  We apply a novel approach to finding complementary items by leveraging dual embedding representations for products. Our model is effective yet simple to implement, making it a great candidate for generating complementary item recommendations at any e-commerce website.
  arXiv  Detail & Related papers  (2022-11-28T00:58:21Z)
• Entity-Graph Enhanced Cross-Modal Pretraining for Instance-level Product Retrieval [152.3504607706575]
  This research aims to conduct weakly-supervised multi-modal instance-level product retrieval for fine-grained product categories. We first contribute the Product1M datasets, and define two real practical instance-level retrieval tasks. We exploit to train a more effective cross-modal model which is adaptively capable of incorporating key concept information from the multi-modal data.
  arXiv  Detail & Related papers  (2022-06-17T15:40:45Z)
• ItemSage: Learning Product Embeddings for Shopping Recommendations at Pinterest [60.841761065439414]
  At Pinterest, we build a single set of product embeddings called ItemSage to provide relevant recommendations in all shopping use cases. This approach has led to significant improvements in engagement and conversion metrics, while reducing both infrastructure and maintenance cost.
  arXiv  Detail & Related papers  (2022-05-24T02:28:58Z)
• Deep Reinforcement Learning-Based Product Recommender for Online Advertising [1.7778609937758327]
  This paper compares value-based and policy-based deep RL algorithms for designing recommender systems for online advertising. The designed recommender systems aim at maximising the click-through rate (CTR) for the recommended items.
  arXiv  Detail & Related papers  (2021-01-30T23:05:04Z)

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.