A Survey on E-Commerce Learning to Rank

• URL: http://arxiv.org/abs/2412.03581v1
• Date: Tue, 19 Nov 2024 01:12:51 GMT
• Title: A Survey on E-Commerce Learning to Rank
• Authors: Md. Ahsanul Kabir, Mohammad Al Hasan, Aritra Mandal, Daniel Tunkelang, Zhe Wu,
• Abstract summary: Commercial e-commerce platforms, such as, Amazon, Alibaba, eBay, Walmart, etc. perform extensive and relentless research to perfect their search result ranking algorithms. For optimizing search result ranking numerous features are considered, which emerge from relevance, personalization, seller's reputation and paid promotion. It is difficult to know which of the algorithms or which of the features is the most effective for finding the most optimal search result ranking in e-commerce.
• Score: 6.6344943112608314
• License:
• Abstract: In e-commerce, ranking the search results based on users' preference is the most important task. Commercial e-commerce platforms, such as, Amazon, Alibaba, eBay, Walmart, etc. perform extensive and relentless research to perfect their search result ranking algorithms because the quality of ranking drives a user's decision to purchase or not to purchase an item, directly affecting the profitability of the e-commerce platform. In such a commercial platforms, for optimizing search result ranking numerous features are considered, which emerge from relevance, personalization, seller's reputation and paid promotion. To maintain their competitive advantage in the market, the platforms do no publish their core ranking algorithms, so it is difficult to know which of the algorithms or which of the features is the most effective for finding the most optimal search result ranking in e-commerce. No extensive surveys of ranking to rank in the e-commerce domain is also not yet published. In this work, we survey the existing e-commerce learning to rank algorithms. Besides, we also compare these algorithms based on query relevance criterion on a large real-life e-commerce dataset and provide a quantitative analysis. To the best of our knowledge this is the first such survey which include an experimental comparison among various learning to rank algorithms.

Related papers

• Identifying High Consideration E-Commerce Search Queries [27.209699168631445]
  We propose an Engagement-based Query Ranking (EQR) approach to identify High Consideration (HC) queries in e-commerce sites. EQR prioritizes query-level features related to customer behavior, finance, and catalog information rather than popularity signals. The model was commercially deployed, and shown to outperform human-selected queries in terms of downstream customer impact.
  arXiv  Detail & Related papers  (2024-10-17T18:22:42Z)
• Information Discovery in e-Commerce [97.71958017283593]
  Information retrieval has a natural role to play in e-commerce, especially in connecting people to goods and services. The rise in popularity of e-commerce sites has made research on information discovery in e-commerce an increasingly active research area. Methods for information discovery in e-commerce largely focus on improving the effectiveness of e-commerce search and recommender systems.
  arXiv  Detail & Related papers  (2024-10-08T07:41:01Z)
• Exploring Query Understanding for Amazon Product Search [62.53282527112405]
  We study how query understanding-based ranking features influence the ranking process. We propose a query understanding-based multi-task learning framework for ranking. We present our studies and investigations using the real-world system on Amazon Search.
  arXiv  Detail & Related papers  (2024-08-05T03:33:11Z)
• A Gold Standard Dataset for the Reviewer Assignment Problem [117.59690218507565]
  "Similarity score" is a numerical estimate of the expertise of a reviewer in reviewing a paper. Our dataset consists of 477 self-reported expertise scores provided by 58 researchers. For the task of ordering two papers in terms of their relevance for a reviewer, the error rates range from 12%-30% in easy cases to 36%-43% in hard cases.
  arXiv  Detail & Related papers  (2023-03-23T16:15:03Z)
• Online Learning of Optimally Diverse Rankings [63.62764375279861]
  We propose an algorithm that efficiently learns the optimal list based on users' feedback only. We show that after $T$ queries, the regret of LDR scales as $O((N-L)log(T))$ where $N$ is the number of all items.
  arXiv  Detail & Related papers  (2021-09-13T12:13:20Z)
• Abstractive Opinion Tagging [65.47649273721679]
  In e-commerce, opinion tags refer to a ranked list of tags provided by the e-commerce platform that reflect characteristics of reviews of an item. Current mechanisms for generating opinion tags rely on either manual or labelling methods, which is time-consuming and ineffective. We propose an abstractive opinion tagging framework, named AOT-Net, to generate a ranked list of opinion tags given a large number of reviews.
  arXiv  Detail & Related papers  (2021-01-18T05:08:15Z)
• PiRank: Learning To Rank via Differentiable Sorting [85.28916333414145]
  We propose PiRank, a new class of differentiable surrogates for ranking. We show that PiRank exactly recovers the desired metrics in the limit of zero temperature.
  arXiv  Detail & Related papers  (2020-12-12T05:07:36Z)
• Does Fair Ranking Improve Minority Outcomes? Understanding the Interplay of Human and Algorithmic Biases in Online Hiring [9.21721532941863]
  We analyze various sources of gender biases in online hiring platforms, including the job context and inherent biases of the employers. Our results demonstrate that while fair ranking algorithms generally improve the selection rates of underrepresented minorities, their effectiveness relies heavily on the job contexts and candidate profiles.
  arXiv  Detail & Related papers  (2020-12-01T11:45:27Z)
• Addressing Purchase-Impression Gap through a Sequential Re-ranker [3.5004721334756934]
  We present methods to address the purchase-impression gap observed in top search results on eCommerce sites. We establish the ideal distribution of items based on historic shopping patterns. We then present a sequential reranker that methodically reranks top search results produced by a conventional pointwise scoring ranker.
  arXiv  Detail & Related papers  (2020-10-27T19:26:51Z)
• Controlling Fairness and Bias in Dynamic Learning-to-Rank [31.41843594914603]
  We propose a learning algorithm that ensures notions of amortized group fairness, while simultaneously learning the ranking function from implicit feedback data. The algorithm takes the form of a controller that integrates unbiased estimators for both fairness and utility. In addition to its rigorous theoretical foundation and convergence guarantees, we find empirically that the algorithm is highly practical and robust.
  arXiv  Detail & Related papers  (2020-05-29T17:57:56Z)

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.