Identifying Substitute and Complementary Products for Assortment Optimization with Cleora Embeddings

• URL: http://arxiv.org/abs/2208.06262v1
• Date: Wed, 10 Aug 2022 11:56:36 GMT
• Title: Identifying Substitute and Complementary Products for Assortment Optimization with Cleora Embeddings
• Authors: Sergiy Tkachuk, Anna Wr\'oblewska, Jacek D\k{a}browski, Szymon {\L}ukasik
• Abstract summary: The paper introduces a novel method for finding products' substitutes and complements based on the graph embedding Cleora algorithm. It is concluded that the new approach presented here offers suitable choices of recommended products, requiring a minimal amount of additional information.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent years brought an increasing interest in the application of machine learning algorithms in e-commerce, omnichannel marketing, and the sales industry. It is not only to the algorithmic advances but also to data availability, representing transactions, users, and background product information. Finding products related in different ways, i.e., substitutes and complements is essential for users' recommendations at the vendor's site and for the vendor - to perform efficient assortment optimization. The paper introduces a novel method for finding products' substitutes and complements based on the graph embedding Cleora algorithm. We also provide its experimental evaluation with regards to the state-of-the-art Shopper algorithm, studying the relevance of recommendations with surveys from industry experts. It is concluded that the new approach presented here offers suitable choices of recommended products, requiring a minimal amount of additional information. The algorithm can be used in various enterprises, effectively identifying substitute and complementary product options.

Related papers

• Evaluating Ensemble Methods for News Recommender Systems [50.90330146667386]
  This paper demonstrates how ensemble methods can be used to combine many diverse state-of-the-art algorithms to achieve superior results on the Microsoft News dataset (MIND) Our findings demonstrate that a combination of NRS algorithms can outperform individual algorithms, provided that the base learners are sufficiently diverse.
  arXiv  Detail & Related papers  (2024-06-23T13:40:50Z)
• Rethinking and Benchmarking Predict-then-Optimize Paradigm for Combinatorial Optimization Problems [62.25108152764568]
  Many web applications rely on solving optimization problems, such as energy cost-aware scheduling, budget allocation on web advertising, and graph matching on social networks. We consider the performance of prediction and decision-making in a unified system. We provide a comprehensive categorization of current approaches and integrate existing experimental scenarios.
  arXiv  Detail & Related papers  (2023-11-13T13:19:34Z)
• Embedding in Recommender Systems: A Survey [67.67966158305603]
  A crucial aspect is embedding techniques that covert the high-dimensional discrete features, such as user and item IDs, into low-dimensional continuous vectors. Applying embedding techniques captures complex entity relationships and has spurred substantial research. This survey covers embedding methods like collaborative filtering, self-supervised learning, and graph-based techniques.
  arXiv  Detail & Related papers  (2023-10-28T06:31:06Z)
• Impression-Aware Recommender Systems [57.38537491535016]
  Novel data sources bring new opportunities to improve the quality of recommender systems. Researchers may use impressions to refine user preferences and overcome the current limitations in recommender systems research. We present a systematic literature review on recommender systems using impressions.
  arXiv  Detail & Related papers  (2023-08-15T16:16:02Z)
• Towards High-Order Complementary Recommendation via Logical Reasoning Network [19.232457960085625]
  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.
  arXiv  Detail & Related papers  (2022-12-09T16:27:03Z)
• 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)
• 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 Learning-based Online Alternative Product Recommendations at Scale [0.2278231643598956]
  We use both textual product information (e.g. product titles and descriptions) and customer behavior data to recommend alternative products. Our results show that the coverage of alternative products is significantly improved in offline evaluations as well as recall and precision.
  arXiv  Detail & Related papers  (2021-04-15T16:27:45Z)
• A Retail Product Categorisation Dataset [2.538209532048867]
  identification of similar products is a common sub-task. Our goal is to boost the evaluation of machine learning methods for the prediction of the category of the retail products.
  arXiv  Detail & Related papers  (2021-03-25T14:23:48Z)
• Exploration-Exploitation Motivated Variational Auto-Encoder for Recommender Systems [1.52292571922932]
  We introduce an exploitation-exploration motivated variational auto-encoder (XploVAE) to collaborative filtering. To facilitate personalized recommendations, we construct user-specific subgraphs, which contain the first-order proximity capturing observed user-item interactions. A hierarchical latent space model is utilized to learn the personalized item embedding for a given user, along with the population distribution of all user subgraphs.
  arXiv  Detail & Related papers  (2020-06-05T17:37:46Z)
• A Survey on Knowledge Graph-Based Recommender Systems [65.50486149662564]
  We conduct a systematical survey of knowledge graph-based recommender systems. We focus on how the papers utilize the knowledge graph for accurate and explainable recommendation. We introduce datasets used in these works.
  arXiv  Detail & Related papers  (2020-02-28T02:26:30Z)

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.