Exploring Customer Price Preference and Product Profit Role in Recommender Systems

• URL: http://arxiv.org/abs/2203.06641v1
• Date: Sun, 13 Mar 2022 12:08:06 GMT
• Title: Exploring Customer Price Preference and Product Profit Role in Recommender Systems
• Authors: Michal Kompan, Peter Gaspar, Jakub Macina, Matus Cimerman and Maria Bielikova
• Abstract summary: We show the impact of manipulating profit awareness of a recommender system. We propose an adjustment of a predicted ranking for score-based recommender systems. In the experiments, we show the ability to improve both the precision and the generated recommendations' profit.
• Score: 0.4724825031148411
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Most of the research in the recommender systems domain is focused on the optimization of the metrics based on historical data such as Mean Average Precision (MAP) or Recall. However, there is a gap between the research and industry since the leading Key Performance Indicators (KPIs) for businesses are revenue and profit. In this paper, we explore the impact of manipulating the profit awareness of a recommender system. An average e-commerce business does not usually use a complicated recommender algorithm. We propose an adjustment of a predicted ranking for score-based recommender systems and explore the effect of the profit and customers' price preferences on two industry datasets from the fashion domain. In the experiments, we show the ability to improve both the precision and the generated recommendations' profit. Such an outcome represents a win-win situation when e-commerce increases the profit and customers get more valuable recommendations.

Related papers

• A Survey of Retrieval Algorithms in Ad and Content Recommendation Systems [5.017244805491932]
  This survey examines the most effective retrieval algorithms utilized in ad recommendation and content recommendation systems. Ad targeting algorithms rely on detailed user profiles and behavioral data to deliver personalized advertisements. organic retrieval systems aim to improve user experience by recommending content that matches user preferences.
  arXiv  Detail & Related papers  (2024-06-21T02:31:03Z)
• Monte Carlo Tree Search Boosts Reasoning via Iterative Preference Learning [55.96599486604344]
  We introduce an approach aimed at enhancing the reasoning capabilities of Large Language Models (LLMs) through an iterative preference learning process. We use Monte Carlo Tree Search (MCTS) to iteratively collect preference data, utilizing its look-ahead ability to break down instance-level rewards into more granular step-level signals. The proposed algorithm employs Direct Preference Optimization (DPO) to update the LLM policy using this newly generated step-level preference data.
  arXiv  Detail & Related papers  (2024-05-01T11:10:24Z)
• Algorithmic Collusion or Competition: the Role of Platforms' Recommender Systems [2.551933457838182]
  This study examines how recommendation algorithms can determine the competitive or collusive dynamics of AI-based pricing algorithms. Experimental results reveal that a profit-based recommender system intensifies algorithmic collusion among sellers due to its congruence with sellers' profit-maximizing objectives. A demand-based recommender system fosters price competition among sellers and results in a lower price, owing to its misalignment with sellers' goals.
  arXiv  Detail & Related papers  (2023-09-25T21:45:30Z)
• Breaking Feedback Loops in Recommender Systems with Causal Inference [99.22185950608838]
  Recent work has shown that feedback loops may compromise recommendation quality and homogenize user behavior. We propose the Causal Adjustment for Feedback Loops (CAFL), an algorithm that provably breaks feedback loops using causal inference. We show that CAFL improves recommendation quality when compared to prior correction methods.
  arXiv  Detail & Related papers  (2022-07-04T17:58:39Z)
• 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)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• 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)
• CPFair: Personalized Consumer and Producer Fairness Re-ranking for Recommender Systems [5.145741425164946]
  We present an optimization-based re-ranking approach that seamlessly integrates fairness constraints from both the consumer and producer-side. We demonstrate through large-scale experiments on 8 datasets that our proposed method is capable of improving both consumer and producer fairness without reducing overall recommendation quality.
  arXiv  Detail & Related papers  (2022-04-17T20:38:02Z)
• Towards Revenue Maximization with Popular and Profitable Products [69.21810902381009]
  A common goal for companies marketing is to maximize the return revenue/profit by utilizing the various effective marketing strategies. Finding credible and reliable information on products' profitability is difficult since most products tends to peak at certain times. This paper proposes a general profit-oriented framework to address the problem of revenue based on economic behavior, and conducting the 0n-shelf Popular and most Profitable Products (OPPPs) for the targeted marketing.
  arXiv  Detail & Related papers  (2022-02-26T02:07:25Z)
• Causality-Aware Neighborhood Methods for Recommender Systems [3.0919302844782717]
  Business objectives of recommenders, such as increasing sales, are aligned with the causal effect of recommendations. Previous recommenders employ the inverse propensity scoring (IPS) in causal inference. We develop robust ranking methods for the causal effect of recommendations.
  arXiv  Detail & Related papers  (2020-12-17T08:23:17Z)

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.