Event-based Product Carousel Recommendation with Query-Click Graph

Luyi Ma, Nimesh Sinha, Parth Vajge, Jason Hd Cho, Sushant Kumar, Kannan AchanarXiv 2024 · arXiv

TL;DR

Researchers at Walmart Global Tech have developed a new recommender system that automatically generates event-based product carousels (like "Grills" or "Patio Furniture" for Labor Day). By applying iterative clustering to a query-click bipartite graph, the system identifies distinct "aspects" of an event and populates them with relevant products, significantly reducing the need for manual human curation.

What Problem Does This Paper Address?

In e-commerce, shopping behavior shifts dramatically during events like Valentine's Day, the Super Bowl, or seasonal transitions. Standard recommender systems typically focus on Product-to-Product (P2P) or User-to-Product (U2P) relationships. However, these fail to capture the multi-faceted nature of an event.

For instance, a "Labor Day" event isn't just one category; it encompasses diverse shopping demands ranging from outdoor grills to electronics. Currently, these "aspects" and their associated product carousels are manually curated by humans—a process that is slow, expensive, and difficult to scale as catalogs and trends evolve. The challenge in automating this lies in the lack of "ground truth" data: there is no predefined list of what constitutes an "aspect" for every possible event.

Fig. 1: Product Carousels for Labor Day on Walmart.com. Each carousel, presented by its icon in (a), represents a event- related aspect and users can browse the product carousel of a certain aspect by a click on the carousel’s icon, for example, the patio carousel in (b) and the electronics carousel in (c).

Methods

The authors propose an effective recommender system based on a query-click bipartite graph.

  1. Graph Construction: They build a graph where one set of nodes represents search queries containing event-related keywords (e.g., "valentines day cards") and the other set represents product-types (e.g., "Greeting Cards"). Using product-types instead of individual items helps reduce data sparsity and increases the model's generality.
  2. Iterative Clustering (IC): Because the query-click data is sparse, a single round of clustering often fails to group similar queries that don't share the exact same clicks. The authors use an iterative agglomerative hierarchical clustering approach. In each round, they:
  3. Create feature vectors for query and product-type clusters based on aggregated clicks and impressions.
  4. Merge the most similar clusters.
  5. Recompute feature vectors for the next round.
  6. Carousel Generation: Once the query clusters (representing event aspects) are formed, the system identifies the most relevant product-types for each cluster by ranking them based on their Click-Through Rate (CTR).
Fig. 2: Overview of the training (a) and recommendation (b) stages.

Datasets

The model was evaluated using real-world traffic data from Walmart.com:

  • Valentine’s Day 2020: ~693k queries and 2,528 unique impression product-types.
  • Summer Water Activity 2021: ~34k queries and 821 unique impression product-types.

Human experts provided ground truth labels by identifying specific product-types that should belong to these events to measure the model's precision.

Key Insights and Ideas

  • Product-Types over Products: The decision to cluster at the product-type level is a crucial engineering choice. It bypasses the "cold start" problem for individual new items and makes the graph dense enough for meaningful clustering.
  • Iterative Refinement: The "aha moment" is that iterative clustering acts as a bridge. By merging nodes and re-calculating similarities, the model discovers latent relationships between queries that a standard one-pass algorithm (like DBSCAN or basic Hierarchical Clustering) would miss due to the "long tail" of search queries.
  • Query Dominance: The ablation study (comparing IC-1, query-only clustering, vs. IC-2, alternating query and product clustering) revealed that clustering queries is the most impactful step. This is because e-commerce platforms have a massive number of unique queries but a relatively limited, stable set of product-types.

Key Results

The proposed Iterative Clustering (IC) models significantly outperformed baselines like standard Hierarchical Clustering (HC) and DBSCAN:

  • Precision: For Valentine’s Day, the IC models achieved a precision of 71.43%, compared to just 35.71% for standard HC and 64.29% for DBSCAN.
  • Robustness: The IC models remained stable across different distance thresholds ($\tau$), whereas the performance of baseline models fluctuated wildly.
  • Cohesion and Heterogeneity: The system successfully balanced two opposing goals: making sure products within a carousel were similar (cohesion) while ensuring different carousels covered distinct aspects of the event (heterogeneity). For example, for the Super Bowl, it automatically generated distinct carousels for "Party Supplies," "Apparel," "Game Watching (TVs)," "Snacks," and "Decorations."

Limitations and Future Work

The authors note that while the system is highly effective at mining aspects from existing search behavior, it still relies on the initial selection of queries containing event-related keywords.

Future work could involve:

  • Automated Keyword Expansion: Moving beyond simple regex-based query selection to identify event-related queries that don't explicitly contain the event name.
  • Dynamic Weighting: Incorporating temporal trends more aggressively to account for how event aspects change in the weeks leading up to a holiday (e.g., moving from "decorations" to "last-minute gifts").

Summary updated

Abstract

Many current recommender systems mainly focus on the product-to-product recommendations and user-to-product recommendations even during the time of events rather than modeling the typical recommendations for the target event (e.g., festivals, seasonal activities, or social activities) without addressing the multiple aspects of the shopping demands for the target event. Product recommendations for the multiple aspects of the target event are usually generated by human curators who manually identify the aspects and select a list of aspect-related products (i.e., product carousel) for each aspect as recommendations. However, building a recommender system with machine learning is non-trivial due to the lack of both the ground truth of event-related aspects and the aspect-related products. To fill this gap, we define the novel problem as the event-based product carousel recommendations in e-commerce and propose an effective recommender system based on the query-click bipartite graph. We apply the iterative clustering algorithm over the query-click bipartite graph and infer the event-related aspects by the clusters of queries. The aspect-related recommendations are powered by the click-through rate of products regarding each aspect. We show through experiments that this approach effectively mines product carousels for the target event.
BibTeX
@misc{ma2024event,
  author = {Luyi Ma and Nimesh Sinha and Parth Vajge and Jason HD Cho and Sushant Kumar and Kannan Achan},
  title = {{Event-based Product Carousel Recommendation with Query-Click Graph}},
  year = {2024},
  eprint = {2402.03277},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2402.03277},
}
Figure