Seasonality Based Reranking of E-commerce Autocomplete Using Natural Language Queries

• URL: http://arxiv.org/abs/2308.02055v1
• Date: Thu, 3 Aug 2023 21:14:25 GMT
• Title: Seasonality Based Reranking of E-commerce Autocomplete Using Natural Language Queries
• Authors: Prateek Verma, Shan Zhong, Xiaoyu Liu and Adithya Rajan
• Abstract summary: Query autocomplete (QAC) also known as typeahead, suggests list of complete queries as user types prefix in the search box. One of the goals of typeahead is to suggest relevant queries to users which are seasonally important. We propose a neural network based natural language processing (NLP) algorithm to incorporate seasonality as a signal.
• Score: 15.37457156804212
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Query autocomplete (QAC) also known as typeahead, suggests list of complete queries as user types prefix in the search box. It is one of the key features of modern search engines specially in e-commerce. One of the goals of typeahead is to suggest relevant queries to users which are seasonally important. In this paper we propose a neural network based natural language processing (NLP) algorithm to incorporate seasonality as a signal and present end to end evaluation of the QAC ranking model. Incorporating seasonality into autocomplete ranking model can improve autocomplete relevance and business metric.

Related papers

• AmazonQAC: A Large-Scale, Naturalistic Query Autocomplete Dataset [14.544120039123934]
  We introduce AmazonQAC, a new QAC dataset sourced from Amazon Search logs, comprising 395M samples. The dataset includes actual sequences of user-typed prefixes leading to final search terms, as well as session IDs and timestamps. We assess Prefix Trees, semantic retrieval, and Large Language Models (LLMs) with and without finetuning.
  arXiv  Detail & Related papers  (2024-10-22T21:11:34Z)
• Long-Span Question-Answering: Automatic Question Generation and QA-System Ranking via Side-by-Side Evaluation [65.16137964758612]
  We explore the use of long-context capabilities in large language models to create synthetic reading comprehension data from entire books. Our objective is to test the capabilities of LLMs to analyze, understand, and reason over problems that require a detailed comprehension of long spans of text.
  arXiv  Detail & Related papers  (2024-05-31T20:15:10Z)
• Sequential Decision-Making for Inline Text Autocomplete [14.83046358936405]
  We study the problem of improving inline autocomplete suggestions in text entry systems. We use reinforcement learning to learn suggestion policies through repeated interactions with a target user.
  arXiv  Detail & Related papers  (2024-03-21T22:33:16Z)
• LIST: Learning to Index Spatio-Textual Data for Embedding based Spatial Keyword Queries [53.843367588870585]
  List K-kNN spatial keyword queries (TkQs) return a list of objects based on a ranking function that considers both spatial and textual relevance. There are two key challenges in building an effective and efficient index, i.e., the absence of high-quality labels and the unbalanced results. We develop a novel pseudolabel generation technique to address the two challenges.
  arXiv  Detail & Related papers  (2024-03-12T05:32:33Z)
• Search Intenion Network for Personalized Query Auto-Completion in E-Commerce [23.839760520476744]
  QAC systems face two major challenges:1)intention equivocality(IE): during the user's typing process,the prefix often contains a combination of characters and subwords, which makes the current intention ambiguous and difficult to model. Previous works make personalized recommendations based on users' historical sequences, but ignore the search intention transfer.
  arXiv  Detail & Related papers  (2024-03-05T02:53:24Z)
• Improving Text Matching in E-Commerce Search with A Rationalizable, Intervenable and Fast Entity-Based Relevance Model [78.80174696043021]
  We propose a novel model called the Entity-Based Relevance Model (EBRM) The decomposition allows us to use a Cross-encoder QE relevance module for high accuracy. We also show that pretraining the QE module with auto-generated QE data from user logs can further improve the overall performance.
  arXiv  Detail & Related papers  (2023-07-01T15:44:53Z)
• Recommender Systems with Generative Retrieval [58.454606442670034]
  We propose a novel generative retrieval approach, where the retrieval model autoregressively decodes the identifiers of the target candidates. To that end, we create semantically meaningful of codewords to serve as a Semantic ID for each item. We show that recommender systems trained with the proposed paradigm significantly outperform the current SOTA models on various datasets.
  arXiv  Detail & Related papers  (2023-05-08T21:48:17Z)
• 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)
• Deep Pairwise Learning To Rank For Search Autocomplete [4.8371021653616975]
  We propose a novel context-aware neural network based pairwise ranker to improve Autocomplete ranking. Compared to Lambda ranker, DeepPLTR shows +3.90% MeanReciprocalRank (MRR) lift in offline evaluation, and yielded +0.06% (p 0.1) Gross Merchandise Value (GMV) lift in an Amazon's online A/B experiment.
  arXiv  Detail & Related papers  (2021-08-11T00:33:18Z)
• Query Rewriting via Cycle-Consistent Translation for E-Commerce Search [13.723266150864037]
  We propose a novel deep neural network based approach to query rewriting. We formulate query rewriting into a cyclic machine translation problem. We introduce a novel cyclic consistent training algorithm in conjunction with state-of-the-art machine translation models.
  arXiv  Detail & Related papers  (2021-03-01T06:47:12Z)
• Session-Aware Query Auto-completion using Extreme Multi-label Ranking [61.753713147852125]
  We take the novel approach of modeling session-aware query auto-completion as an e Multi-Xtreme Ranking (XMR) problem. We adapt a popular XMR algorithm for this purpose by proposing several modifications to the key steps in the algorithm. Our approach meets the stringent latency requirements for auto-complete systems while leveraging session information in making suggestions.
  arXiv  Detail & Related papers  (2020-12-09T17:56:22Z)

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.