Grouping Search Results with Product Graphs in E-commerce Platforms

• URL: http://arxiv.org/abs/2109.09349v1
• Date: Mon, 20 Sep 2021 08:01:29 GMT
• Title: Grouping Search Results with Product Graphs in E-commerce Platforms
• Authors: Suhas Ranganath, Shibsankar Das, Sanjay Thilaivasan, Shipra Agarwal, Varun Shrivastava
• Abstract summary: This paper proposes a framework to group search results into multiple ranked lists intending to provide better user intent. As an example, for a query "milk," the results can be grouped into multiple stacks of "white milk", "low-fat milk", "almond milk", "flavored milk"
• Score: 2.887393074590696
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Showing relevant search results to the user is the primary challenge for any search system. Walmart e-commerce provides an omnichannel search platform to its customers to search from millions of products. This search platform takes a textual query as input and shows relevant items from the catalog. One of the primary challenges is that this queries are complex to understand as it contains multiple intent in many cases. This paper proposes a framework to group search results into multiple ranked lists intending to provide better user intent. The framework is to create a product graph having relations between product entities and utilize it to group search results into a series of stacks where each stack provides a group of items based on a precise intent. As an example, for a query "milk," the results can be grouped into multiple stacks of "white milk", "low-fat milk", "almond milk", "flavored milk". We measure the impact of our algorithm by evaluating how it improves the user experience both in terms of search quality relevance and user behavioral signals like Add-To-Cart.

Related papers

• Database-Augmented Query Representation for Information Retrieval [59.57065228857247]
  We present a novel retrieval framework called Database-Augmented Query representation (DAQu) DAQu augments the original query with various (query-related) metadata across multiple tables. We validate DAQu in diverse retrieval scenarios that can incorporate metadata from the relational database.
  arXiv  Detail & Related papers  (2024-06-23T05:02:21Z)
• Large Language Models for Relevance Judgment in Product Search [48.56992980315751]
  High relevance of retrieved and re-ranked items to the search query is the cornerstone of successful product search. We present an array of techniques for leveraging Large Language Models (LLMs) for automating the relevance judgment of query-item pairs (QIPs) at scale. Our findings have immediate implications for the growing field of relevance judgment automation in product search.
  arXiv  Detail & Related papers  (2024-06-01T00:52:41Z)
• OmniSearchSage: Multi-Task Multi-Entity Embeddings for Pinterest Search [2.917688415599187]
  We present OmniSearchSage, a versatile and scalable system for understanding search queries, pins, and products for Pinterest search. We jointly learn a unified query embedding coupled with pin and product embeddings, leading to an improvement of $>8%$ relevance, $>7%$ engagement, and $>5%$ ads CTR.
  arXiv  Detail & Related papers  (2024-04-25T00:10:25Z)
• STaRK: Benchmarking LLM Retrieval on Textual and Relational Knowledge Bases [93.96463520716759]
  We develop STARK, a large-scale Semi-structure retrieval benchmark on Textual and Knowledge Bases. Our benchmark covers three domains: product search, academic paper search, and queries in precision medicine. We design a novel pipeline to synthesize realistic user queries that integrate diverse relational information and complex textual properties.
  arXiv  Detail & Related papers  (2024-04-19T22:54:54Z)
• Searching, fast and slow, through product catalogs [5.077235981745305]
  We present a unified architecture for SKU search that provides both a real-time suggestion system and a lower latency search system. We show how our system vastly outperforms, in all aspects, the results provided by the default search engine.
  arXiv  Detail & Related papers  (2024-01-01T12:30:46Z)
• Shopping Queries Dataset: A Large-Scale ESCI Benchmark for Improving Product Search [26.772851310517954]
  This paper introduces the "Shopping Queries dataset", a large dataset of difficult Amazon search queries and results. The dataset contains around 130 thousand unique queries and 2.6 million manually labeled (product) relevance judgements. The dataset is being used in one of the KDDCup'22 challenges.
  arXiv  Detail & Related papers  (2022-06-14T04:25:26Z)
• Graph Enhanced BERT for Query Understanding [55.90334539898102]
  query understanding plays a key role in exploring users' search intents and facilitating users to locate their most desired information. In recent years, pre-trained language models (PLMs) have advanced various natural language processing tasks. We propose a novel graph-enhanced pre-training framework, GE-BERT, which can leverage both query content and the query graph.
  arXiv  Detail & Related papers  (2022-04-03T16:50:30Z)
• Exposing Query Identification for Search Transparency [69.06545074617685]
  We explore the feasibility of approximate exposing query identification (EQI) as a retrieval task by reversing the role of queries and documents in two classes of search systems. We derive an evaluation metric to measure the quality of a ranking of exposing queries, as well as conducting an empirical analysis focusing on various practical aspects of approximate EQI.
  arXiv  Detail & Related papers  (2021-10-14T20:19:27Z)
• 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)
• 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)
• Query Intent Detection from the SEO Perspective [0.34376560669160383]
  We aim to identify the user query's intent by taking advantage of Google results and machine learning methods. A list of keywords extracted from the clustered queries is used to identify the intent of a new given query.
  arXiv  Detail & Related papers  (2020-06-16T13:08:29Z)

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.